Escaping offline searchers and isoperimetric theorems

DOI10.1016/j.comgeo.2008.08.001zbMath1156.68574OpenAlexW2021208601MaRDI QIDQ955225

Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin, Peter Brass

Publication date: 19 November 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.08.001

zbMATH Keywords

lion and man problemisoperimetric theoremoffline searcher

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

How many lions are needed to clear a grid? ⋮ How to hunt an invisible rabbit on a graph ⋮ Reversibility properties of the fire-fighting problem in graphs ⋮ Improved bounds for cops-and-robber pursuit ⋮ Bounds for cops and robber pursuit ⋮ Geometric firefighting in the half-plane

Cites Work

• The complexity of pursuit on a graph
• A game of cops and robbers
• Note on a pursuit game played on graphs
• Isoperimetric inequalities for densities of lattice-periodic sets
• On a game of policemen and robber
• Edge isoperimetric theorems for integer point arrays
• The complexity of searching a graph
• 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

This page was built for publication: Escaping offline searchers and isoperimetric theorems