Dispersion of mobile robots on directed anonymous graphs
From MaRDI portal
Publication:2097347
Cites work
- scientific article; zbMATH DE number 1559557 (Why is no real title available?)
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- Collective tree exploration
- Computing by mobile robotic sensors
- Dispersion of mobile robots on grids
- Dispersion of mobile robots: the power of randomness
- Distributed computing by mobile robots: gathering
- Efficient Dispersion of Mobile Agents without Global Knowledge
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Fast collaborative graph exploration
- Graph exploration by a finite automaton
- Label-guided graph exploration by a finite automaton
- Lower and upper competitive bounds for online directed graph exploration
- Time and space optimality of rotor-router graph exploration
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Uniform multi-agent deployment on a ring
- Uniform scattering of autonomous mobile robots in a grid
This page was built for publication: Dispersion of mobile robots on directed anonymous graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097347)