• DOI:10.1016/j.jctb.2014.11.002
Corpus ID: 15432889

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

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.