Using collective of agents for exploration of graph

Stepkin A.V.
 pdf (110K)  / List of references

Problem of exploration finite undirected graphs by a collective of agents is considered in this work. Two agents-researchers simultaneously move on graph, they read and change marks of graph elements, transfer the information to the agent-experimenter (it builds explored graph representation). It was constructed an algorithm linear (from amount of the graph’s nodes) time complexity, quadratic space complexity and communication complexity, that is equal to O(n2·log(n)). Two agents (which move on graph) need two different colors (in total three colors) for graph exploration. An algorithm is based on depth-first traversal method.

Keywords: graph exploration, collective of agents
Citation in English: Stepkin A.V. Using collective of agents for exploration of graph // Computer Research and Modeling, 2013, vol. 5, no. 4, pp. 525-532
Citation in English: Stepkin A.V. Using collective of agents for exploration of graph // Computer Research and Modeling, 2013, vol. 5, no. 4, pp. 525-532
DOI: 10.20537/2076-7633-2013-5-4-525-532
URL: http://crm-en.ics.org.ru/journal/article/2062/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.
Views (last year): 4. Citations: 2 (RSCI).

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science