A Simple Randomized k-Local Election Algorithm for Local Computations

  • Rodrigue Ossamy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)


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.


Local computations election in graphs distributed algorithms randomized algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on theory of computing, pp. 82–93 (1980)Google Scholar
  2. 2.
    Awerbuch, B., Peleg, D.: Network synchronization with polylogarithmic overhead. In: IEEE Symp. on Foundations of Computer Science, pp. 514–522 (1990)Google Scholar
  3. 3.
    Bauderon, M., Gruner, S., Métivier, Y., Mosbah, M., Sellami, A.: Visualization of distributed algorithms based on labeled rewriting systems. In: Second International Workshop on Graph Transformation and Visual Modeling Techniques, Crete, Greece, July 12-13 (2001)Google Scholar
  4. 4.
    Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. 3, pp. 1–56. World Scientific, Singapore (1999)Google Scholar
  5. 5.
    Lynch, N.A.: Distributed algorithms. Morgan Kaufman, San Francisco (1996)zbMATHGoogle Scholar
  6. 6.
    Métivier, Y., Saheb, N., Zemmari, A.: Randomized local elections. Inform. Proc. Letters, 313–320 (2002)Google Scholar
  7. 7.
    Moore, E.F.: The shortest path through a maze. In: Proceedings of an International Symposium on the theory of Switching, Cambridge, Massachusetts, April 2-5, pp. 285–292. Harvard University Press, Cambridge (1959)Google Scholar
  8. 8.
    Ossamy, R.: A simple randomized k-local election algorithm for local computations. Technical Report 1344-05, LaBRI-University of Bordeaux I (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rodrigue Ossamy
    • 1
  1. 1.LaBRIUniversity of Bordeaux ITalenceFrance

Personalised recommendations