We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph.

Abstract. We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected ...

We provide the first strategy which performs exploration of a graph with n vertices at a distance of at most D from r in time O(D), using a team of agents.

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph.

Apr 26, 2013 · We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished.

Apr 4, 2013 · We have graph G = (V,E) and k agents initially located at node r. Agents can traverse edges of the graph according to some algorithm.

Dec 11, 2014 · We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an ...

Jun 23, 2020 · What I want to do is exactly this - Fast collaborative graph exploration. We study the following scenario of online graph exploration. A team ...

Mar 19, 2013 · Abstract. We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r ...

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph.