Self-Stabilizing Leader Election in Regular Graphs

DOI10.1145/3382734.3405733MaRDI QIDQ5855235zbMATH OpenOpenAlexFDO

Authors Hsueh-Ping Chen, Ho-Lin Chen

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

Euler cycleleader electionpopulation protocolsregular graphsself-stabilizingspanning tree

Mathematics Subject Classification ID

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

Cited in

(5)

• A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
• Near-optimal leader election in population protocols on graphs
• Complete graph identification in population protocols
• Sublinear-time collision detection in population protocols with polynomially many states
• Time-optimal self-stabilizing leader election in population protocols

This page was built for publication: Self-Stabilizing Leader Election in Regular Graphs

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