Buscar
-
Efficient Exploration of Anonymous Undirected Graphs
Communication dans un congrès -
Collision-Free Network Exploration
Communication dans un congrès -
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random Walks
Communication dans un congrès -
Cost Minimization in Multi-Interface Networks
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Robustness of the rotor-router mechanism
Communication dans un congrès -
Euler Tour Lock-in Problem in the Rotor-Router Model
Communication dans un congrès -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès