Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
From MaRDI portal
Publication:5387746
DOI10.1007/978-3-540-77120-3_8zbMath1193.68267MaRDI QIDQ5387746
Chan-Su Shin, Kyue D. Kim, Hyeon-Suk Na, Peter Brass
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_8
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On a Fire Fighter’s Problem, Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning, Lions and contamination, triangular grids, and Cheeger constants, Lions and contamination: monotone clearings
Cites Work
- The complexity of pursuit on a graph
- Edge isoperimetric theorems for integer point arrays
- Searching for a Mobile Intruder in a Polygonal Region
- Search Games with Mobile and Immobile Hider
- Randomized Pursuit-Evasion in Graphs
- An Isoperimetric Inequality on the Discrete Torus
- ON THE CONSTRUCTION OF SOLUTIONS OF A DISCRETE ISOPERIMETRIC PROBLEM IN HAMMING SPACE
- Solution of David Gale's lion and man problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item