A tight lower bound for the capture time of the cops and robbers game
From MaRDI portal
Publication:2196569
DOI10.1016/j.tcs.2020.06.004zbMath1448.91050OpenAlexW3033047515MaRDI QIDQ2196569
Yuval Emek, Roger Wattenhofer, Jara Uitto, Sebastian F. Brandt
Publication date: 3 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7413/
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Cops and robber on butterflies, grids, and AT-free graphs ⋮ The localization capture time of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizations of \(k\)-copwin graphs
- The capture time of grids
- Bounds on the length of a game of cops and robbers
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- The capture time of a graph
- Cops and robbers in graphs with large girth and Cayley graphs
- On a pursuit game played on graphs for which a minor is excluded
- On the cop number of a graph
- Vertex-to-vertex pursuit in a graph
- Some remarks on cops and drunk robbers
- Meyniel's conjecture on the cop number: a survey
- The capture time of the hypercube
- On Meyniel's conjecture of the cop number
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
- A Tight Lower Bound for the Capture Time of the Cops and Robbers Game
- Cops, robbers, and threatening skeletons
This page was built for publication: A tight lower bound for the capture time of the cops and robbers game
