Uniform election in trees and polyominoids

DOI10.1016/j.dam.2010.01.008zbMath1205.05218OpenAlexW2096361090MaRDI QIDQ708324

John Michael Robson, Akka Zemmari, Nasser Saheb-Djahromi, Abdelaaziz El Hibaoui

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Medians and centres of polyominoes
• Solvability of the asynchronous ranking problem
• Locally guided randomized elections in trees: The totally fair case
• On the recognition of families of graphs with local computations
• Introduction to Distributed Algorithms

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