Document Type

Article

Date of Original Version

11-20-2014

DOI

10.1016/j.jctb.2014.11.002

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.

Share

COinS