This article is cited in 1 paper

Search under counteraction

V. Yu. Andrianov, N. N. Petrov


Abstract: In this paper, new problems of guaranteed graph searching are considered. The issue of finding a least number of pursuers, which are able (in some sense) to complete the search of an “nvisible” evader, is stated.

UDC: 517.977

Received: 01.03.2004

 English version: Proceedings of the Steklov Institute of Mathematics (Supplement Issues), 2005, suppl. 1, S16–S24

Bibliographic databases:

• 
• 
•