Note on a helicopter search problem on graphs
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.
scientific article; zbMATH DE number 1340639