How to meet asynchronously at polynomial cost

DOI10.1145/2484239.2484245MaRDI QIDQ6829773zbMATH OpenFDO

Authors Yoann Dieudonné, Andrzej Pelc, Vincent Villain

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2484239.2484245

zbMATH Keywords

networkdeterministic algorithmleader electiongossipingrendezvousrenamingasynchronous mobile agents

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)

Cited in

(1)

• Exploiting automorphisms of temporal graphs for fast exploration and rendezvous

This page was built for publication: How to meet asynchronously at polynomial cost

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