Randomized local elections.

DOI10.1016/S0020-0190(01)00289-7zbMath1043.68115OpenAlexW2118991742MaRDI QIDQ1853021

Akka Zemmari, Nasser Saheb, Yves Métivier

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00289-7

zbMATH Keywords

Performance analysisGraphRandomized algorithmAnalysis of algorithmLocal election

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Applications of graph theory (05C90) Distributed systems (68M14)

Related Items (3)

Sublinear fully distributed partition with applications ⋮ Mobile Agents Implementing Local Computations in Graphs ⋮ Broadcast in the rendezvous model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to Distributed Algorithms
• Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”.

This page was built for publication: Randomized local elections.