Fast searching games on graphs

Given a graph, suppose that intruders hide on vertices or along edges of the graph. The fast searching problem is to find the minimum number of searchers required to capture all the intruders satisfying the constraint that every edge is traversed exactly once and searchers are not allowed to jump. In this paper, we prove lower bounds on the fast search number. We present a linear time algorithm to compute the fast search number of Halin graphs and their extensions. We present a quadratic time algorithm to compute the fast search number of cubic graphs.

[1]  Daniel Bienstock,et al.  Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey) , 1989, Reliability Of Computer And Communication Networks.

[2]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

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

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

[5]  Robin W. Dawes,et al.  Some Pursuit-Evasion Problems on Grids , 1992, Inf. Process. Lett..

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

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

[8]  Dimitrios M. Thilikos,et al.  A 3-approximation for the pathwidth of Halin graphs , 2006, J. Discrete Algorithms.

[9]  B. Alspach.  SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .

[10]  D. West.  Introduction to Graph Theory , 1995 .

[11]  Craig A. Tovey,et al.  Algorithms for recognition of regular properties and decomposition of recursive graph families , 1991, Ann. Oper. Res..

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

[13]  Robert Warren,et al.  Lower bounds on the pathwidth of some grid-like graphs , 2008, Discret. Appl. Math..

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

[15]  Dimitrios M. Thilikos,et al.  Fugitive-Search Games on Graphs and Related Parameters , 1997, Theor. Comput. Sci..

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

[17]  Ichiro Suzuki,et al.  Optimal Algorithms for a Pursuit-Evasion Problem in Grids , 1989, SIAM J. Discret. Math..

[18]  Pawel Pralat,et al.  Cleaning a network with brushes , 2008, Theor. Comput. Sci..

[19]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.