Sciweavers

Share
DAM
1999

Note on a Helicopter Search Problem on Graphs

8 years 11 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for the cop in this problem depends only on the robber's speed. We investigate the problem of finding the minimal robber's speed which prevents the cop from winning. For this parameter we give tight bounds in terms of the linkage and the pathwidth of a graph. Key words: Searching a graph, pathwidth, linkage.
Fedor V. Fomin
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where DAM
Authors Fedor V. Fomin
Comments (0)
books