A simple randomized k-local election algorithm for local computations

Authors:
Rodrigue Ossamy
Affiliations:
LaBRI, University of Bordeaux I, Talence, France
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 5
Cited 0

Graph relabelling systems and distributed algorithms

Handbook of graph grammars and computing by graph transformation
Randomized local elections

Information Processing Letters
Distributed Algorithms

Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Network synchronization with polylogarithmic overhead

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of distributed algorithms encoded by means of local computations [3] need to solve k–local election problems to ensure a faithful relabeling of disjoint subgraphs. Due to a result stated in [1], it is not possible to solve the k–local election problem for k ≥ 3 in anonymous networks. Based on distributed computations of rooted trees of minimal paths, we present in this paper a simple randomized algorithm which, with very high probability, solves the k-local election problem (k ≥ 2) in an anonymous graph.