Some remarks on cops and drunk robbers
From MaRDI portal
Publication:1929226
DOI10.1016/j.tcs.2012.08.016zbMath1258.91042MaRDI QIDQ1929226
Paweł Prałat, Athanasios Kehagias
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.016
Related Items
Lazy Cops and Robbers on Hypercubes, A game theoretic analysis of the cops and robber game, Simultaneously moving cops and robbers, A probabilistic version of the game of zombies and survivors on graphs, Cops and invisible robbers: the cost of drunkenness, Selfish cops and passive robber: qualitative games, General cops and robbers games with randomness, The capture time of the hypercube, Burning graphs: a probabilistic perspective, Chasing a drunk robber in many classes of graphs, A tight lower bound for the capture time of the cops and robbers game, Zero-visibility cops and robber and the pathwidth of a graph, Containment game played on random graphs: another zig-zag theorem
Cites Work
- Simultaneously moving cops and robbers
- The capture time of grids
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- Cops and robbers in graphs with large girth and Cayley graphs
- Optimal control of diffusion processes with reflection
- A game of cops and robbers played on products of graphs
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Meyniel's conjecture holds for random graphs
- Chasing robbers on random graphs: Zigzag theorem
- Pursuit-Evasion in Models of Complex Networks
- Collisions Among Random Walks on a Graph
- A Survey of Applications of Markov Decision Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item