Uniform election in trees and polyominoids

DOI10.1016/J.DAM.2010.01.008zbMATH Open1205.05218OpenAlexW2096361090MaRDI QIDQ708324FDOQ708324

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

Recommendations

• scientific article
• 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

zbMATH Keywords

fairnesstreesdistributed algorithmselectionpolyominoids

Mathematics Subject Classification ID

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

Cites Work

• Introduction to Distributed Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solvability of the asynchronous ranking problem
• Medians and centres of polyominoes
• Title not available (Why is that?)
• Locally guided randomized elections in trees: The totally fair case
• On the recognition of families of graphs with local computations
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)