Optimal Algorithms for a Pursuit-Evasion Problem in Grids
From MaRDI portal
Publication:3833623
DOI10.1137/0402013zbMath0677.68057OpenAlexW1976015566MaRDI QIDQ3833623
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402013
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Related Items (15)
A pursuit-evasion problem on a grid ⋮ A cops and robber game in multidimensional grids ⋮ Helicopter search problems, bandwidth and pathwidth ⋮ Fast searching games on graphs ⋮ The theory of guaranteed search on graphs ⋮ An annotated bibliography on guaranteed graph searching ⋮ Some pursuit-evasion problems on grids ⋮ On the domination search number ⋮ Vision-Based Pursuit-Evasion in a Grid ⋮ Pursuit of a Moving Target with Known Constant Speed on a Directed Acyclic Graph under Partial Information ⋮ Standard directed search strategies and their applications ⋮ Lower bound for the advantage coefficient in the search problem on graphs ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Searching expenditure and interval graphs ⋮ The searchlight problem for road networks
This page was built for publication: Optimal Algorithms for a Pursuit-Evasion Problem in Grids