Different speeds suffice for rendezvous of two agents on arbitrary graphs

DOI10.1007/978-3-319-51963-0_7MaRDI QIDQ2971126zbMATH OpenOpenAlexFDO

Authors Euripides Markou, Aris Pagourtzis, Evangelos Kranakis, D. Krizanc, Felipe A. Ramírez

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

zbMATH Keywords

graphmobile agentsrendezvousspeedsuniversal exploration sequence

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous with different maps
• Deterministic rendezvous in graphs
• Deterministic rendezvous in graphs

Cites work

• Asynchronous deterministic rendezvous in bounded terrains
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Rendezvous Search: A Personal Perspective
• The Rendezvous Search Problem
• The theory of search games and rendezvous.
• Undirected connectivity in log-space
• Universal traversal sequences with backtracking.

Cited in

(8)

• Byzantine gathering in polynomial time
• Searching for a non-adversarial, uncooperative agent on a cycle
• scientific article; zbMATH DE number 1729496 (Why is no real title available?)
• Byzantine gathering in polynomial time
• 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*
• Symmetry breaking in the plane. Rendezvous by robots with unknown attributes

This page was built for publication: Different speeds suffice for rendezvous of two agents on arbitrary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971126)