Geodesic
Reconstruction of a labeled graph by a graph-walking mobile agent
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 15 (2015) no. 2, pp. 228-238

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

The problem of construction of graph-like operational environment by a mobile agent is considered. The model of environment is defined as a simple undirected vertex labeled graph. We propose a polynomial time algorithm of graph reconstruction and labeling for the collective consisting of agent-explorer and agent-supervisor. 
@article{ISU_2015_15_2_a14,
     author = {S. V. Sapunov},
     title = {Reconstruction of a labeled graph by a graph-walking mobile agent},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {228--238},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2015_15_2_a14/}
}
TY  - JOUR
AU  - S. V. Sapunov
TI  - Reconstruction of a labeled graph by a graph-walking mobile agent
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2015
SP  - 228
EP  - 238
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2015_15_2_a14/
LA  - ru
ID  - ISU_2015_15_2_a14
ER  - 
%0 Journal Article
%A S. V. Sapunov
%T Reconstruction of a labeled graph by a graph-walking mobile agent
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2015
%P 228-238
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2015_15_2_a14/
%G ru
%F ISU_2015_15_2_a14
S. V. Sapunov. Reconstruction of a labeled graph by a graph-walking mobile agent. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 15 (2015) no. 2, pp. 228-238. http://geodesic.mathdoc.fr/item/ISU_2015_15_2_a14/