Fast dispersion of mobile robots on arbitrary graphs
From MaRDI portal
Recommendations
Cites work
- Autonomous mobile robots with lights
- Collective tree exploration
- Dispersion of mobile robots: the power of randomness
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Fast collaborative graph exploration
- Graph exploration by a finite automaton
- Introduction to algorithms.
- Label-guided graph exploration by a finite automaton
- Time and space optimality of rotor-router graph exploration
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Uniform multi-agent deployment on a ring
Cited in
(13)- Dispersion of mobile robots: the power of randomness
- Near-optimal dispersion on arbitrary anonymous graphs
- Distance-2-dispersion with termination by a strong team
- Efficient dispersion in triangular grids without prior knowledge
- Fault-tolerant dispersion of mobile robots
- Path connected dynamic graphs with a study of dispersion and exploration
- Dispersion of mobile robots on graphs in the asynchronous model
- Near-optimal dispersion on arbitrary anonymous graphs
- Maximum independent set formation on a finite grid by myopic robots
- Near-linear time dispersion of mobile agents
- Balanced dispersion on time-varying dynamic graphs
- Optimal dispersion of silent robots in a ring
- Dispersion of mobile robots on grids
This page was built for publication: Fast dispersion of mobile robots on arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536152)
