oaioai:digitalcommons.uri.edu:math_facpubs-1001

Cops and Robbers is EXPTIME-Complete

Authors
Publication date
20 November 2014
Publisher
DigitalCommons@URI
Doi

    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

    Similar works

    Full text

    thumbnail-image

    This paper was published in DigitalCommons@URI.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.