Robustness of the rotor-router mechanism
From MaRDI portal
Publication:2408092
DOI10.1007/s00453-016-0179-yzbMath1372.68199OpenAlexW2462265923MaRDI QIDQ2408092
Adrian Kosowski, David Ilcinkas, Nicolas Hanusse, Leszek Gąsieniec, Evangelos Bampas, Ralf Klasing, Tomasz Radzik
Publication date: 9 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0179-y
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
Coalescing Walks on Rotor-Router Systems ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks ⋮ Exploration of dynamic networks: tight bounds on the number of agents
Cites Work
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- Limit behavior of the multi-agent rotor-router system
- The power of a pebble: Exploring and mapping directed graphs
- A distributed ant algorithm for efficiently patrolling a network
- Graph exploration by a finite automaton
- Improved Analysis of Deterministic Load-Balancing Schemes
- Bounds on the Cover Time of Parallel Rotor Walks
- Tree exploration with logarithmic memory
- Simulating a Random Walk with Constant Error
- Chip-Firing and Rotor-Routing on Directed Graphs
- Deterministic Random Walks on the Two-Dimensional Grid
- Undirected connectivity in log-space
- Distributed Algorithms For Unidirectional Networks
- Traversing Directed Eulerian Mazes
- Exploring an unknown graph
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
- The multi-agent rotor-router on the ring
- Memory Efficient Anonymous Graph Exploration
- Economic Traversal of Labyrinths
- On Unicursal Paths in a Network of Degree 4
This page was built for publication: Robustness of the rotor-router mechanism
