A simple randomized k-local election algorithm for local computations

DOI10.1007/11427186_26MaRDI QIDQ5710027zbMATH OpenOpenAlexFDO

Authors Rodrigue Ossamy

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

zbMATH Keywords

distributed algorithmselection in graphsLocal computationsrandomized algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Foundations of Software Science and Computation Structures
• What Can be Computed Locally?
• Graph Transformations
• Locally guided randomized elections in trees: The totally fair case
• Local computations in graphs: the case of cellular edge local computations

Cited in

(6)

• Locally guided randomized elections in trees: The totally fair case
• Mobile Agents Implementing Local Computations in Graphs
• Local Computation Schemes with Partially Ordered Preferences
• Foundations of Software Science and Computation Structures
• Universal semi-local election protocol using forward links
• Uniform election in trees and polyominoids

This page was built for publication: A simple randomized \(k\)-local election algorithm for local computations

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