Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
On the pathwidth of chordal graphs
Discrete Applied Mathematics - ARIDAM IV and V
Treewidth of chordal bipartite graphs
Journal of Algorithms
Treewidth for graphs with small chordality
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Connected searching of weighted trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Connected searching of weighted trees
Theoretical Computer Science
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
Hi-index | 0.05 |
Graph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426-441]: given a ''contaminated'' graph G (e.g., a network containing a hostile intruder), the search numbers(G) of the graph G is the minimum number of searchers needed to ''clear'' the graph (or to capture the intruder). A search strategy is connected if, at every step of the strategy, the set of cleared edges induces a connected subgraph. The connected search number cs(G) of a graph G is the minimum k such that there exists a connected search strategy for the graph G using at most k searchers. This paper is concerned with the ratio between the connected search number and the search number. We prove that, for any chordal graph G of treewidth tw(G), cs(G)/s(G)=O(tw(G)). More precisely, we propose a polynomial-time algorithm that, given any chordal graph G, computes a connected search strategy for G using at most (tw(G)+2)(2s(G)-1) searchers. Our main tool is the notion of connected tree-decomposition. We show that, for any connected graph G of chordality k, there exists a connected search strategy using at most (tw(G)@?k/2@?+2)(2s(T)-1) searchers where T is an optimal tree-decomposition of G.