caa a22 4500 60551934X CHVBK 20210128100730.0 cr unu---uuuuu 210128e20150301xx s 000 0 eng 10.1007/s10559-015-9715-z doi (NATIONALLICENCE)springer-10.1007/s10559-015-9715-z Stepkin A. Donbass State Pedagogical University, Slovyansk, Ukraine aut Using a Collective of Agents for Exploration of Undirected Graphs [Elektronische Daten] [A. Stepkin] This paper considers the problem of exploration of finite undirected graphs by a collective of agents. Two agents-researchers simultaneously traverse a graph, read and change labels of graph elements, and send necessary information to the agent-experimenter constructing a representation of the graph being explored. An exploration algorithm is proposed with a linear (with respect to the number of vertices) time complexity and a quadratic space complexity. An optimization procedure is developed that partitions a graph with a view to exploring its parts by different agents. Each of the agents traversing a graph needs two different colors (three colors are used in the aggregate) for exploring a graph. The algorithm is based on the depth-first traversal method. Springer Science+Business Media New York, 2015 exploration of graphs nationallicence collective of agents nationallicence graph traversal nationallicence Cybernetics and Systems Analysis Springer US; http://www.springer-ny.com 51/2(2015-03-01), 223-233 1060-0396 51:2<223 2015 51 10559 https://doi.org/10.1007/s10559-015-9715-z text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s10559-015-9715-z text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Stepkin A. Donbass State Pedagogical University, Slovyansk, Ukraine aut NATIONALLICENCE 773 0- Cybernetics and Systems Analysis Springer US; http://www.springer-ny.com 51/2(2015-03-01), 223-233 1060-0396 51:2<223 2015 51 10559