Rendezvous of Mobile Agents in Directed Graphs

DOI10.1007/978-3-642-15763-9_27zbMath1290.68018OpenAlexW1543762072MaRDI QIDQ3588309

Shantanu Das, Jérémie Chalopin, Peter Widmayer

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15763-9_27

zbMATH Keywords

directed graphrendezvousdistributed algorithmmobile agentsleader electiongraph explorationanonymous networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

MinMax-Distance Gathering on Given Meeting Points ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms

This page was built for publication: Rendezvous of Mobile Agents in Directed Graphs