Geodesic
Search under counteraction
Trudy Instituta matematiki i mehaniki, Dynamical systems and control problems, Tome 11 (2005) no. 1, pp. 17-25

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{TIMM_2005_11_1_a1,
     author = {V. Yu. Andrianov and N. N. Petrov},
     title = {Search under counteraction},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {17--25},
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2005_11_1_a1/}
}
TY  - JOUR
AU  - V. Yu. Andrianov
AU  - N. N. Petrov
TI  - Search under counteraction
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2005
SP  - 17
EP  - 25
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMM_2005_11_1_a1/
LA  - ru
ID  - TIMM_2005_11_1_a1
ER  - 
%0 Journal Article
%A V. Yu. Andrianov
%A N. N. Petrov
%T Search under counteraction
%J Trudy Instituta matematiki i mehaniki
%D 2005
%P 17-25
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2005_11_1_a1/
%G ru
%F TIMM_2005_11_1_a1
V. Yu. Andrianov; N. N. Petrov. Search under counteraction. Trudy Instituta matematiki i mehaniki, Dynamical systems and control problems, Tome 11 (2005) no. 1, pp. 17-25. http://geodesic.mathdoc.fr/item/TIMM_2005_11_1_a1/