The Complexity of Zero-Visibility Cops and Robber

In this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.

[1]  Anthony Bonato,et al.  The Game of Cops and Robbers on Graphs , 2011 .

[2]  Boting Yang,et al.  Zero-Visibility Cops and Robber Game on a Graph , 2013, FAW-AAIM.

[3]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[4]  Fedor V. Fomin,et al.  Mixed search number and linear-width of interval and split graphs , 2010 .

[5]  Boting Yang,et al.  Zero-visibility cops and robber and the pathwidth of a graph , 2015, J. Comb. Optim..

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

[7]  Boting Yang,et al.  Searching Cycle-Disjoint Graphs , 2007, COCOA.

[8]  Gary MacGillivray,et al.  Characterizations of k-copwin graphs , 2012, Discret. Math..

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

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

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

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

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