Efficient Exploration of Anonymous Undirected Graphs

Ralf Klasing (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms

We consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot's walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on equitable strategies and on the multi-agent rotor-router.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Ralf Klasing. Efficient Exploration of Anonymous Undirected Graphs. Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Jul 2013, Rouen, France. pp.7-13, ⟨10.1007/978-3-642-45278-9_2⟩. ⟨hal-00927154⟩