Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
From MaRDI portal
Publication:2971126
DOI10.1007/978-3-319-51963-0_7zbMath1433.68046OpenAlexW2571112048MaRDI QIDQ2971126
Euripides Markou, Aris Pagourtzis, Felipe A. Ramírez, Evangelos Kranakis, Danny Krizanc
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: http://www.springer.com/us/book/9783319519623
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ Optimal rendezvous on a line by location-aware robots in the presence of spies* ⋮ Byzantine gathering in polynomial time ⋮ Unnamed Item ⋮ Searching for a non-adversarial, uncooperative agent on a cycle
Cites Work
- Unnamed Item
- Asynchronous deterministic rendezvous in bounded terrains
- The theory of search games and rendezvous.
- Universal traversal sequences with backtracking.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Undirected connectivity in log-space
- Rendezvous Search: A Personal Perspective
- The Rendezvous Search Problem
- How to meet asynchronously at polynomial cost
- LATIN 2004: Theoretical Informatics
This page was built for publication: Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
