Leader Election in Well-Connected Graphs

DOI10.1145/3212734.3212754zbMath1428.68069arXiv1901.00342OpenAlexW2810680129MaRDI QIDQ5197688

Seth Gilbert, Suman Sourav, Peter Robinson

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.00342

zbMATH Keywords

random walksmixing timeleader electionconductanceimplicit leader election

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (4)

Improved deterministic leader election in diameter-two networks ⋮ Leader election in well-connected graphs ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ The complexity of leader election in diameter-two networks

This page was built for publication: Leader Election in Well-Connected Graphs