Cops and Robbers is EXPTIME-complete

@article{Kinnersley2015CopsAR,
  title={Cops and Robbers is EXPTIME-complete},
  author={B. Kinnersley},
  journal={J. Comb. Theory, Ser. B},
  year={2015},
  volume={111},
  pages={201-220}
}
  • B. Kinnersley
  • Published 2015
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • We investigate the computational complexity of deciding whether k cops can capture a robber on a graph G. Goldstein and Reingold (1995) 8] conjectured that the problem is EXPTIME-complete when both G and k are part of the input; we prove this conjecture. 
    41 Citations

    Figures, Tables, and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Conjectures on Cops and Robbers
    • 8
    • PDF
    The complexity of zero-visibility cops and robber
    • 9
    The game of Cops and Robber on circulant graphs
    • 2
    New Results on the Zero-Visibility Cops and Robber Game
    • 2
    A study of cops and robbers in oriented graphs.
    • 3
    Cops and Robbers on String Graphs
    • 3
    • PDF
    Cops and robbers on oriented graphs
    • 1
    • PDF
    Fine-grained Lower Bounds on Cops and Robbers
    • PDF
    Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries
    • 9
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    A note on k-cop, l-robber games on graphs
    • 93
    • PDF
    Characterizations of k-copwin graphs
    • 38
    • PDF
    Pursuing a fast robber on a graph
    • 65
    • PDF
    Cops and Robber with Constraints
    • 5
    • PDF
    A game of cops and robbers
    • 385
    • PDF
    The Complexity of Pursuit on a Graph
    • 77
    • Highly Influential
    • PDF
    On the computational complexity of a game of cops and robbers
    • M. Mamino
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2013
    • 17
    • Highly Influential
    • PDF
    On the Cop Number of a Graph
    • 105
    The Game of Cops and Robbers on Graphs
    • 272
    • PDF
    Pursuit and Evasion from a Distance: Algorithms and Bounds
    • 17
    • PDF