Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
The vertex separation number of a graph equals its path-width
Information Processing Letters
Recontamination does not help to search a graph
Journal of the ACM (JACM)
On the pathwidth of chordal graphs
Discrete Applied Mathematics - ARIDAM IV and V
The vertex separation and search number of a graph
Information and Computation
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Time constrained graph searching
Theoretical Computer Science
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Searching Trees with Sources and Targets
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Cleaning Regular Graphs with Brushes
SIAM Journal on Discrete Mathematics
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Fast edge searching and fast searching on graphs
Theoretical Computer Science
| Hi-index | 0.04 |
In the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates a larger number of searchers. We examine this model, and characterize graphs for which 2 or 3 searchers are sufficient. We prove that the corresponding decision problem is NP-complete.