Pages that link to "Item:Q2398496"
From MaRDI portal
The following pages link to Time and space optimality of rotor-router graph exploration (Q2398496):
Displaying 7 items.
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (Q5167868) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)
- Fast dispersion of mobile robots on arbitrary graphs (Q6536152) (← links)
- Graph exploration by a deterministic memoryless automaton with pebbles (Q6585255) (← links)