Note on a helicopter search problem on graphs

DOI10.1016/S0166-218X(99)00078-5MaRDI QIDQ1302160zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin

Publication date 22 September 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00078-5

zbMATH Keywords

search problemsearch two-player gametwo-person games

Mathematics Subject Classification ID

2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Review text

The author studies a search two-player game where a player (called Cop) tries to find the other player (called Robber) and Robber tries to evade. The players move in a finite, undirected topological graph embedded in an Euclidean space. The existence of a winning strategy for Cop depends only on Robber's speed. The author's analysis deals with the minimal speed which guarantees that Cop will not win.

Recommendations

• Discrete search programs on graphs
• Helicopter search problems, bandwidth and pathwidth
• scientific article; zbMATH DE number 4125215
• Almost discrete search programs on graphs
• Ambush Strategies in Search Games on Graphs

Cited in

(4)

• Helicopter search problems, bandwidth and pathwidth
• The theory of guaranteed search on graphs
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• An annotated bibliography on guaranteed graph searching

This page was built for publication: Note on a helicopter search problem on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302160)