How to Guard a Graph?

We initiate the study of the algorithmic foundations of games in which a set of cops has to guard a region in a graph (or digraph) against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to find the minimum number of cops needed to prevent the robber from entering the guarded region. The problem is highly non-trivial even if the robber’s or the cops’ regions are restricted to very simple graphs. The computational complexity of the problem depends heavily on the chosen restriction. In particular, if the robber’s region is only a path, then the problem can be solved in polynomial time. When the robber moves in a tree (or even in a star), then the decision version of the problem is NP-complete. Furthermore, if the robber is moving in a directed acyclic graph, the problem becomes PSPACE-complete.

[1]  P. Varaiya,et al.  Differential games , 1971 .

[2]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[3]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[6]  Hiroshi Nagamochi.  Cop-Robber Guarding Game with Cycle Robber Region , 2009, FAW.

[7]  B. Intrigila,et al.  On the Cop Number of a Graph , 1993 .

[8]  S. Louis Hakimi,et al.  On Path Cover Problems in Digraphs and Applications to Program Testing , 1979, IEEE Transactions on Software Engineering.

[9]  Lorna Stewart,et al.  Maximum independent set and maximum clique algorithms for overlap graphs , 2003, Discret. Appl. Math..

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

[11]  Gary MacGillivray,et al.  A note on k-cop, l-robber games on graphs , 2006, Discret. Math..

[12]  Alain Quilliot,et al.  Some Results about Pursuit Games on Metric Spaces Obtained Through Graph Theory Techniques , 1986, Eur. J. Comb..

[13]  Petr A. Golovach,et al.  On tractability of Cops and Robbers game , 2008, IFIP TCS.

[14]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

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

[16]  C. Pandu Rangan,et al.  The Guarding Problem - Complexity and Approximation , 2009, IWOCA.

[17]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[18]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

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

[20]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Edward M. Reingold,et al.  The Complexity of Pursuit on a Graph , 1995, Theor. Comput. Sci..