Title

Cops and Robbers is EXPTIME-Complete

Authors

William B. Kinnersley, University of Rhode IslandFollow

Document Type

Article

Date of Original Version

11-20-2014

Abstract

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.

Citation/Publisher Attribution

Kinnersley, W. B. (2014). Cops and Robbers is EXPTIME-complete. Journal of Combinatorial Theory, Series B, 2011, 201-220. doi: 10.1016/j.jctb.2014.11.002

Available at http://dx.doi.org/10.1016/j.jctb.2014.11.002.