Chasing a drunk robber in many classes of graphs
From MaRDI portal
Publication:2105709
DOI10.1007/s13235-022-00444-0zbMath1502.91011OpenAlexW4224296608MaRDI QIDQ2105709
Nuttanon Songsuwan, Pawaton Kaemawichanurat, Dawud Thongtha
Publication date: 8 December 2022
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-022-00444-0
Sums of independent random variables; random walks (60G50) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Simultaneously moving cops and robbers
- Cops and invisible robbers: the cost of drunkenness
- Capturing the drunk robber on a graph
- The game of Cops and Robber on circulant graphs
- The capture time of grids
- Cops and robber game without recharging
- A game of cops and robbers
- Cops and robbers on intersection graphs
- Vertex-to-vertex pursuit in a graph
- Some remarks on cops and drunk robbers
- On the cop number of toroidal graphs
- Capture-time extremal cop-win graphs
- A note on the cops and robber game on graphs embedded in non-orientable surfaces
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- Cops and Robbers on Geometric Graphs
- On Cumulative Sums of Random Variables
This page was built for publication: Chasing a drunk robber in many classes of graphs
