The game of cops and eternal robbers

DOI10.1016/j.tcs.2021.05.014OpenAlexW3162858855MaRDI QIDQ2034413

Trent G. Marbach, Melissa Huggan, Anthony Bonato, Fionn Mc Inerney

Publication date: 22 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.03791

zbMATH Keywords

gridspursuit-evasion gamestreesgraph algorithmscops and robbersretracts

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (1)

A simple method for proving lower bounds in the zero-visibility cops and robber game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The capture time of grids
• Time constrained graph searching
• The capture time of a graph
• Packing and covering a tree by subtrees
• Spy-game on graphs: complexity and simple topologies
• A note on the eternal dominating set problem
• Meyniel's conjecture on the cop number: a survey
• Study of a combinatorial game in graphs through linear programming
• Cops and robbers is EXPTIME-complete
• Eternally dominating large grids
• Topological directions in cops and robbers
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between

This page was built for publication: The game of cops and eternal robbers