Uniform election in trees and polyominoids

DOI10.1016/J.DAM.2010.01.008MaRDI QIDQ708324zbMATH OpenOpenAlexFDO

Authors Abdelaaziz El Hibaoui, John Michael Robson, N. Saheb-Djahromi, A. Zemmari

Publication date 11 October 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.01.008

zbMATH Keywords

fairnesstreesdistributed algorithmselectionpolyominoids

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 6909297
• Locally guided randomized elections in trees: The totally fair case
• scientific article; zbMATH DE number 1456964
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 2087429

Cites work

• scientific article; zbMATH DE number 6909297 (Why is no real title available?)
• scientific article; zbMATH DE number 108391 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• Introduction to Distributed Algorithms
• Locally guided randomized elections in trees: The totally fair case
• Medians and centres of polyominoes
• On the recognition of families of graphs with local computations
• Solvability of the asynchronous ranking problem

Cited in

(1)

• scientific article; zbMATH DE number 6909297 (Why is no real title available?)

This page was built for publication: Uniform election in trees and polyominoids

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