Towards optimal distributed election on chordal rings

DOI10.1016/0020-0190(91)90069-TzbMath0738.68004OpenAlexW1983344549WikidataQ128037109 ScholiaQ128037109MaRDI QIDQ1178237

T. Z. Kalamboukis, S. L. Mantzaris

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90069-t

zbMATH Keywords

chordal ringsleader election

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (8)

A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings ⋮ On the impact of sense of direction on message complexity ⋮ Minimal sense of direction in regular networks ⋮ Computing on anonymous networks with sense of direction ⋮ Efficient leader election using sense of direction ⋮ Symmetries and sense of direction in labeled graphs ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION ⋮ Sense of direction in distributed computing

Cites Work

• Unnamed Item
• Efficient elections in chordal ring networks
• On the message complexity of distributed problems
• Lower Bounds for Distributed Maximum-Finding Algorithms
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

This page was built for publication: Towards optimal distributed election on chordal rings