Graph reconstruction by automata team

The paper is devoted to analysis and modification of the Basic Algorithm for graph reconstruction by agent, moving through graph edges, reading and modifying marks on the elements of the graph. The algorithm uses an implicit enumeration of graph vertices. The modification of the Basic Algorithm implements the reconstruction by automata team. In this case, the upper bound on the time complexity of the algorithm depends on the number of agents in the automata team that perform the reconstruction.