Randomized local elections.

DOI10.1016/S0020-0190(01)00289-7MaRDI QIDQ1853021zbMATH OpenOpenAlexFDO

Authors A. Zemmari, Yves Métivier, Nasser Saheb

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

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

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 790246 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Introduction to Distributed Algorithms
• Visualization of distributed algorithms based on graph relabelling systems

Cited in

(3)

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

This page was built for publication: Randomized local elections.

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