Fast-mixed searching and related problems on graphs

Abstract In this paper, we introduce the fast–mixed search model, which is a combination of the fast search model and the mixed search model. Given a graph G in which a fugitive hides on vertices or along edges, the fast–mixed search problem is to find the minimum number of searchers to capture the fugitive in the fast–mixed search model. We establish a relation between the fast–mixed search problem and the induced-path cover problem. We also consider relations between the fast–mixed search problem and other graph search problems. We prove that Fast–Mixed Searching From Leaves is NP-complete, and it remains NP-complete for planar graphs with maximum degree 3. We also prove that Fast–Mixed Searching Between Leaves is NP-complete, and it remains NP-complete for graphs with maximum degree 4. We present linear-time algorithms for computing the fast–mixed search number and optimal search strategies of some classes of graphs, including trees, cacti, and proper interval graphs.

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

[2]  Günter Rote,et al.  Minimum-weight triangulation is NP-hard , 2006, JACM.

[3]  Shlomo Moran,et al.  Optimal Covering of Cacti by Vertex-Disjoint Paths , 1991, Theor. Comput. Sci..

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

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

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

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

[8]  Van Bang Le,et al.  Splitting a graph into disjoint induced paths or cycles , 2003, Discret. Appl. Math..

[9]  Gerard J. Chang,et al.  Induced-path partition on graphs with special blocks , 2007, Theor. Comput. Sci..

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

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

[12]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[13]  Boting Yang,et al.  Fast searching games on graphs , 2011, J. Comb. Optim..

[14]  David R. Wood,et al.  On the Complexity of the Balanced Vertex Ordering Problem , 2007, Discret. Math. Theor. Comput. Sci..

[15]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..