Cops and Robbers on Dynamic Graphs: Offline and Online Case

We examine the classic game of Cops and Robbers played on dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the (static) underlying graph. 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 with at most a linear number of edges. We prove ? + 1 cops suffice to capture the robber in any underlying graph with n -1 + ? edges. Furthermore, we define a family of underlying graphs with n -1 + ? edges where ? -1 cops are necessary (and sufficient) for capture.