On asynchronous rendezvous in general graphs
Publication:1625604
DOI10.1016/J.TCS.2018.06.045zbMath1407.68345OpenAlexW2884716215WikidataQ129413548 ScholiaQ129413548MaRDI QIDQ1625604
Arnaud Labourel, Jurek Czyzowicz, Sébastien Tixeuil, Lélia Blin, David Ilcinkas, Evangelos Bampas, Maria Gradinariu Potop-Butucaru
Publication date: 29 November 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-01900843/file/revised_TCS.pdf
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Games on graphs (graph-theoretic aspects) (05C57) Agent technology and artificial intelligence (68T42)
Related Items (1)
Cites Work
- Anonymous meeting in networks
- Gathering fat mobile robots with slim omnidirectional cameras
- Gathering of asynchronous robots with limited visibility
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- The theory of search games and rendezvous.
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Asynchronous deterministic rendezvous in graphs
- Impossibility of gathering by a set of autonomous mobile robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Wait-Free Gathering Without Chirality
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Tell Me Where I Am So I Can Meet You Sooner
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Asynchronous Deterministic Rendezvous on the Line
- How to Gather Asynchronous Oblivious Robots on Anonymous Rings
- How to meet asynchronously at polynomial cost
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Synchronous gathering without multiplicity detection: a certified algorithm
This page was built for publication: On asynchronous rendezvous in general graphs
