Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty

DOI10.1007/978-1-4614-6825-7_12zbMath1356.91029OpenAlexW47932560MaRDI QIDQ2961404

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

Publication date: 20 February 2017

Published in: Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_12

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57) Agent technology and artificial intelligence (68T42)

Related Items (4)

Rendezvous in networks in spite of delay faults ⋮ Reversible causal graph dynamics: invertibility, block representation, vertex-preservation ⋮ Gathering of robots in a ring with mobile faults ⋮ Reversibility vs Local Creation/Destruction

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• The theory of search games and rendezvous.
• Universal traversal sequences with backtracking.
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Time versus space trade-offs for rendezvous in trees
• Gathering asynchronous oblivious mobile robots in a ring
• Deterministic rendezvous in graphs
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
• Mobile Agent Rendezvous in a Synchronous Torus
• Rendezvous of Mobile Agents without Agreement on Local Orientation
• Rendezvous of Mobile Agents in Directed Graphs
• Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
• Effective Elections for Anonymous Mobile Agents
• Principles of Distributed Systems
• SOFSEM 2006: Theory and Practice of Computer Science
• Fibrations of graphs

This page was built for publication: Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty