On the Fast Searching Problem

Edge searching is a graph problem that corresponds to cleaning a contaminated graph using the minimum number of searchers. We define fast searchingas a variant of this widely studied problem. Fast searching corresponds to an internal monotone search in which every edge is traversed exactly once and searchers are not allowed to jump. We present a linear time algorithm to compute the fast search number of trees. We investigate the fast search number of bipartite graphs. We also propose a general cost function for evaluating search strategies that utilizes both edge searching and fast searching.

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

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

[3]  Boting Yang,et al.  Sweeping graphs with large clique number , 2009, Discret. Math..

[4]  Pierre Fraigniaud,et al.  Forewords: Special issue on graph searching , 2008, Theor. Comput. Sci..

[5]  Boting Yang,et al.  Lower Bounds on Edge Searching , 2007, ESCAPE.

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

[7]  D. R. Lick,et al.  Theory and Applications of Graphs , 1978 .

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

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

[10]  Mike Paterson,et al.  Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers , 2007, ESCAPE.

[11]  Petr A. Golovach,et al.  Graph Searching and Interval Completion , 2000, SIAM J. Discret. Math..

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

[13]  Lali Barrière,et al.  Capture of an intruder by mobile agents , 2002, SPAA '02.

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

[15]  Fan Chung,et al.  ON THE CUTWIDTH AND THE TOPOLOGICAL BANDWIDTH OF A TREE , 1985 .

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