Connected graph searching
type: Item
instance of: scholarly article
title: Connected graph searching
zbMATH Open document ID: 1252.91026
author: Lali Barrière
author: P. Flocchini
author: Fedor V. Fomin
author: Pierre Fraigniaud
author: Nicolas Nisse
author: N. Santoro
author: Dimitrios M. Thilikos
published in: Information and Computation
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6110705
zbMATH Keywords: graph searching
zbMATH Keywords: cops-and-robbers
zbMATH Keywords: network security
MaRDI profile type: Publication
full work available at URL: j.ic.2012.08.004
OpenAlex ID: W2053218689
Wikidata QID: Q60488463
cites work: Expander graphs and their applications
cites work: The complexity of searching a graph
cites work: An annotated bibliography on guaranteed graph searching
cites work: Q3477966
cites work: Searching and pebbling
cites work: Eavesdropping games
cites work: Generalized hypertree decompositions: NP-hardness and tractable variants
cites work: Q4159394
cites work: Q3208679
cites work: Interval graphs and searching
cites work: Graph minors. XX: Wagner's conjecture
cites work: Monotonicity in graph searching
cites work: Recontamination does not help to search a graph
cites work: On the monotonicity of games generated by symmetric submodular functions.
cites work: Sweeping graphs with large clique number
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Nondeterministic graph searching: from pathwidth to treewidth
cites work: Parameterized and Exact Computation
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: The number of registers required for evaluating arithmetic expressions
cites work: Some mathematical properties of branching trees with application to the respiratory system
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Connected Graph Searching in Outerplanar Graphs
cites work: Connected Treewidth and Connected Graph Searching
cites work: Connected graph searching in chordal graphs
cites work: BOUNDARY-OPTIMAL TRIANGULATION FLOODING
cites work: Monotony properties of connected visible graph searching
cites work: Distributed chasing of network intruders
cites work: DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
cites work: Decontamination of hypercubes by mobile agents
cites work: The cost of monotonicity in distributed graph searching
cites work: Graph searching with advice
cites work: Q4035355
cites work: Call routing and the ratcatcher
cites work: On embedding trees into uniformly convex Banach spaces
cites work: Q4542534
cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width
cites work: Pathwidth is NP-Hard for Weighted Trees
cites work: From Pathwidth to Connected Pathwidth
cites work: Connected searching of weighted trees
DOI: 10.1016/J.IC.2012.08.004
description: scientific article; zbMATH DE number 6110705