Election and rendezvous with incomparable labels

DOI10.1016/J.TCS.2008.02.006MaRDI QIDQ930904zbMATH OpenOpenAlexFDO

Authors J. 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

anonymous networkselectionmobile agentsqualitative computingrendezvous

Mathematics Subject Classification ID

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

Recommendations

• Election in the Qualitative World
• Leader election for anonymous asynchronous agents in arbitrary networks
• scientific article; zbMATH DE number 2087429
• Graph Transformations
• Rendezvous and election of mobile agents: Impact of sense of direction

Cites work

• Deterministic rendezvous in graphs
• Election in the Qualitative World
• Fibrations of graphs
• scientific article; zbMATH DE number 5286867 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• Map construction of unknown graphs by multiple agents
• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• Rendezvous and election of mobile agents: Impact of sense of direction

Cited in

(1)

• Distributed exploration of dynamic rings

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

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