Note on a helicopter search problem on graphs
type: Item
instance of: scholarly article
title: Note on a helicopter search problem on graphs
zbMATH Open document ID: 0947.91015
DOI: 10.1016/S0166-218X(99)00078-5
published in: Discrete Applied Mathematics
publication date: 1999-09-22T00:00:00Z
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.
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 1340639
zbMATH Keywords: two-person games
zbMATH Keywords: search problem
zbMATH Keywords: search two-player game
author: Fedor V. Fomin
reviewed by: Maurice Salles
MaRDI profile type: Publication
full work available at URL: s0166-218x(99)00078-5
OpenAlex ID: W2096846776
description: scientific article; zbMATH DE number 1340639