|
This article is cited in 2 scientific papers (total in 2 papers)
Computer Sciences
Reconstruction of a labeled graph by a graph-walking mobile agent
S. V. Sapunov Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, 74, R. Luxemburg st., 83114, Donetsk,
Ukraine
Abstract:
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.
Key words:
vertex labeled graphs, mobile agent, graph reconstruction.
Citation:
S. V. Sapunov, “Reconstruction of a labeled graph by a graph-walking mobile agent”, Izv. Saratov Univ. Math. Mech. Inform., 15:2 (2015), 228–238
Linking options:
https://www.mathnet.ru/eng/isu587 https://www.mathnet.ru/eng/isu/v15/i2/p228
|
Statistics & downloads: |
Abstract page: | 238 | Full-text PDF : | 170 | References: | 46 |
|