Three-fast-searchable graphs

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.

[1]  Boting Yang,et al.  On the Fast Searching Problem , 2008, AAIM.

[2]  Boting Yang.  Fast edge searching and fast searching on graphs , 2011, Theor. Comput. Sci..

[3]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[4]  Jens Gustedt,et al.  On the Pathwidth of Chordal Graphs , 1993, Discret. Appl. Math..

[5]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[6]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[7]  Lali Barrière,et al.  Searching Is Not Jumping , 2003, WG.

[8]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[9]  Noga Alon,et al.  Cleaning Regular Graphs with Brushes , 2008, SIAM J. Discret. Math..

[10]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[11]  Timothy M. Chan,et al.  Balanced vertex-orderings of graphs , 2005, Discret. Appl. Math..

[12]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[13]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[14]  Boting Yang,et al.  Searching Trees with Sources and Targets , 2008, FAW.

[15]  Boting Yang,et al.  Time constrained graph searching , 2008, Theor. Comput. Sci..

[16]  Boting Yang,et al.  Sweeping Graphs with Large Clique Number , 2004, ISAAC.

[17]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).