Stefan Balev ; Juan Jiménez Laredo ; Ioannis Lamprou ; Yoann Pigné ; Eric Sanlaville - Cops and Robbers on Dynamic Graphs: Offline and Online Case

dmtcs:8784 - Discrete Mathematics & Theoretical Computer Science, March 16, 2023, vol. 25:1 -
Cops and Robbers on Dynamic Graphs: Offline and Online Case

Authors: Stefan Balev 1; Juan Jiménez Laredo 1; Ioannis Lamprou 2; Yoann Pigné ORCID-iD1; Eric Sanlaville ORCID-iD1

We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model. The cops and the robber take their turns on the current graph instance. The cops win if they can capture the robber at some point in time. Otherwise, the robber wins. In the offline case, the players are fully aware of the evolution sequence, up to some finite time horizon T. We provide a O(n 2k+1 T) algorithm to decide whether a given evolution sequence for an underlying graph with n vertices is k-cop-win via a reduction to a reachability game. In the online case, there is no knowledge of the evolution sequence, and the game might go on forever. Also, each generated instance is required to be connected. We provide a nearly tight characterization for sparse underlying graphs, i.e., with at most linear number of edges. We prove λ + 1 cops suffice to capture the robber in any underlying graph with n − 1 + λ edges. Further, we define a family of underlying graphs with n−1+λ edges where λ−1 cops are necessary (and sufficient) for capture.

Volume: vol. 25:1
Section: Discrete Algorithms
Published on: March 16, 2023
Accepted on: December 30, 2022
Submitted on: December 1, 2021
Keywords: cops and robbers,dynamic graphs,offline,online,sparse,[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 642 times.
This article's PDF has been downloaded 534 times.