Abstract
We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to catch a robber in G, we show that the required number of cops can be much larger, even for graphs with small maximum degree. In particular, we show that there are 3-regular graphs where a linear number of cops are needed.
Author supplied keywords
Cite
CITATION STYLE
Martinsson, A., Meier, F., Schnider, P., & Steger, A. (2018). Even flying cops should think ahead. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10856 LNCS, pp. 326–337). Springer Verlag. https://doi.org/10.1007/978-3-319-96151-4_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
