Search
-
Efficient Exploration of Anonymous Undirected Graphs
Communication dans un congrès -
Collision-Free Network Exploration
Communication dans un congrès -
Gathering of Robots on Anonymous Grids without multiplicity detection
Communication dans un congrès -
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 -
Improved Approximations for TSP with Simple Precedence Constraints
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 -
Gathering in specific radio networks
Communication dans un congrès