The lion and man game on polyhedral surfaces with obstacles
From MaRDI portal
Publication:1643158
DOI10.1016/j.tcs.2018.04.041zbMath1396.91031OpenAlexW2802506877MaRDI QIDQ1643158
Publication date: 18 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.041
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of pursuit on a graph
- A game of cops and robbers
- The role of information in the cop-robber game
- A framework for pursuit evasion games in
- Vertex-to-vertex pursuit in a graph
- Cops and robbers is EXPTIME-complete
- Pursuing a fast robber on a graph
- Pursuit Evasion on Polyhedral Surfaces
- Searching for a Mobile Intruder in a Polygonal Region
- “Lion and Man”: Upper and Lower Bounds
- Randomized Pursuit-Evasion in Graphs
- Capture bounds for visibility-based pursuit evasion
This page was built for publication: The lion and man game on polyhedral surfaces with obstacles