Election and rendezvous with incomparable labels

DOI10.1016/j.tcs.2008.02.006zbMath1146.68019OpenAlexW1966071863MaRDI QIDQ930904

Jérémie Chalopin

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.006

zbMATH Keywords

rendezvousmobile agentselectionanonymous networksqualitative computing

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Distributed exploration of dynamic rings

Cites Work

• Unnamed Item
• Unnamed Item
• Rendezvous and election of mobile agents: Impact of sense of direction
• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• Map construction of unknown graphs by multiple agents
• Election in the Qualitative World
• Algorithms - ESA 2003
• Fibrations of graphs

This page was built for publication: Election and rendezvous with incomparable labels