Pursuit and evasion from a distance: algorithms and bounds
From MaRDI portal
Publication:5194658
DOI10.1137/1.9781611972993.1zbMath1429.05139OpenAlexW4213228023MaRDI QIDQ5194658
Anthony Bonato, Ehsan Chiniforooshan
Publication date: 16 September 2019
Published in: 2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972993.1
Analysis of algorithms (68W40) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
A probabilistic version of the game of zombies and survivors on graphs ⋮ On the cop number of generalized Petersen graphs ⋮ Coarse geometry of the cops and robber game ⋮ Cops that surround a robber ⋮ Lazy Cops and Robbers on Hypercubes ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Cops and robbers is EXPTIME-complete
This page was built for publication: Pursuit and evasion from a distance: algorithms and bounds
