On tractability of Cops and Robbers game

The Cops and Robbers game is played on undirected graphs where a group of cops tries to catch a robber. The game was defined independently by Winkler-Nowakowski and Quilliot in the 1980s and since that time has been studied intensively. Despite of that, its computation complexity is still an open question. In this paper we prove that computing the minimum number of cops that can catch a robber on a given graph is NP-hard. Also we show that the parameterized version of the problem is W[2]-hard. Our proof can be extended to the variant of the game where the robber can move s times faster than cops. We also provide a number of algorithmic and complexity results on classes of chordal graphs and on graphs of bounded cliquewidth. For example, we show that when the velocity of the robber is twice cop’s velocity, the problem is NP-hard on split graphs, while it is polynomial time solvable on split graphs when players posses the same speed. Finally, we establish that on graphs of bounded cliquewidth (this class of graphs contains, for example, graphs of bounded treewidth), the problem is solvable in polynomial time in the case the robber’s speed is at most twice the speed of cops.

[1]  Peter Frankl,et al.  On a pursuit game on cayley graphs , 1987, Comb..

[2]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

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

[4]  Peter Frankl,et al.  Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..

[5]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[6]  Richard J. Nowakowski,et al.  A Vertex-To-Vertex Pursuit Game Played with Disjoint Sets of Edges , 1993 .

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

[8]  Henry Meyniel,et al.  On a game of policemen and robber , 1987, Discret. Appl. Math..

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

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

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

[12]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

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

[14]  Saket Saurabh,et al.  Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles , 2008, Algorithmica.

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

[16]  Alain Quilliot,et al.  A short note about pursuit games played on a graph with a given genus , 1985, J. Comb. Theory, Ser. B.

[17]  Shigeki Iwata,et al.  Some combinatorial game problems require Ω(nk) time , 1984, JACM.

[18]  Thomas Andreae,et al.  On a pursuit game played on graphs for which a minor is excluded , 1986, J. Comb. Theory, Ser. B.

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

[20]  Stephan Olariu,et al.  Asteroidal Triple-Free Graphs , 1993, SIAM J. Discret. Math..

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

[22]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[23]  Thomas ANDREAE,et al.  Note on a pursuit game played on graphs , 1984, Discret. Appl. Math..

[24]  Yahya Ould Hamidoune,et al.  On a Pursuit Game on Cayley Digraphs , 1987, Eur. J. Comb..

[25]  Richard J. Nowakowski,et al.  Copnumber Of Graphs With Strong Isometric Dimension Two , 2001, Ars Comb..

[26]  Robert E. Woodrow,et al.  Finite and Infinite Combinatorics in Sets and Logic , 1993 .

[27]  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.

[28]  Bruno Courcelle,et al.  Context-free Handle-rewriting Hypergraph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

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

[30]  Priti Shankar,et al.  A Combinatorial Family of Near Regular LDPC Codes , 2006, 2007 IEEE International Symposium on Information Theory.

[31]  Chuan Yi Tang,et al.  Graph Searching on Some Subclasses of Chordal Graphs , 2000, Algorithmica.

[32]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[33]  Bernd S. W. Schröder.  The Copnumber of a Graph is Bounded by [3/2 genus ( G )] + 3 , 2001 .