Efficient Exploration of Anonymous Undirected Graphs
KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
< Reduce
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Language
en
Communication dans un congrès
This item was published in
Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), 2013-07-10, Rouen. 2013-07, vol. 8288, p. 7-13
Springer
English Abstract
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. ...Read more >
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.Read less <
ANR Project
Calculabilité et complexité en distribué - ANR-11-BS02-0014
Origin
Hal imported