Dispersion of mobile robots on directed anonymous graphs
DOI10.1007/978-3-031-09993-9_11OpenAlexW4285183905MaRDI QIDQ2097347FDOQ2097347
Authors: Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma 
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_11
dispersionmulti-agent systemsdirected graphsmobile robotslocal and 1-hop communicationtime and memory complexity
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Distributed computing by mobile robots: gathering
- Collective tree exploration
- Title not available (Why is that?)
- Label-guided graph exploration by a finite automaton
- Graph exploration by a finite automaton
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Uniform multi-agent deployment on a ring
- Lower and upper competitive bounds for online directed graph exploration
- Title not available (Why is that?)
- Fast collaborative graph exploration
- Dispersion of mobile robots on grids
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots: the power of randomness
- Time and space optimality of rotor-router graph exploration
- Uniform Deployment of Mobile Agents in Asynchronous Rings
- Computing by mobile robotic sensors
- Efficient Dispersion of Mobile Agents without Global Knowledge
- Uniform scattering of autonomous mobile robots in a grid
Cited In (1)
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)
