https://inria.hal.science/inria-00476686Fomin, Fedor V.Fedor V.FominUiB - Department of Informatics [Bergen] - UiB - University of BergenGolovach, Petr A.Petr A.GolovachUiB - Department of Informatics [Bergen] - UiB - University of BergenKratochvil, JanJanKratochvilKAM - Department of Applied Mathematics (KAM) - Univerzita Karlova v PrazeNisse, NicolasNicolasNisseMASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en Automatique - Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués - I3S - Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis - UNS - Université Nice Sophia Antipolis (1965 - 2019) - COMUE UCA - COMUE Université Côte d'Azur (2015-2019) - CNRS - Centre National de la Recherche Scientifique - UCA - Université Côte d'AzurSuchan, KarolKarolSuchanFacultad de Ingeniería y Ciencias [Santiago] - Universidad Adolfo Ibáñez [Santiago]Pursuing a fast robber on a graphHAL CCSD2010[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Nisse, Nicolas2010-04-27 09:02:312023-03-24 14:52:532010-04-27 09:16:23enJournal articleshttps://inria.hal.science/inria-00476686/document10.1016/j.tcs.2009.12.010application/pdf1The Cops and Robbers game is played on undirected graphs where a group of cops tries to catch a robber. The game was deﬁned independently by Winkler-Nowakowski and Quilliot in the 1980s and since that time has been studied intensively. Despite of that, its computation complexity is still an open question. In this paper we prove that computing the minimum number of cops that can catch a robber on a given graph is NP-hard. Also we show that the parameterized version of the problem is W[2]-hard. Our proof can be extended to the variant of the game where the robber can move s times faster than the cops. We also provide a number of algorithmic and complexity results on classes of chordal graphs and on graphs of bounded cliquewidth. For example, we show that when the velocity of the robber is twice the cop's velocity, the problem is NP-hard on split graphs, while it is polynomial time solvable on split graphs when players have the same speed. Also we establish that on graphs of bounded cliquewidth (this class of graphs contains, for example, graphs of bounded treewidth), the problem is solvable in polynomial time in the case the robber's speed is at most twice the speed of cops. Finally, we show that if the robber is faster than the cops then the minimum number of cops is unbounded for planar graphs.