Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Locality in Distributed Graph Algorithms

  • Pierre FraigniaudEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_608

Years and Authors of Summarized Original Work

  • 1992; Linial

  • 1995; Naor, Stockmeyer

  • 2013; Fraigniaud, Korman, Peleg

Problem Definition

In the context of distributed network computing, an important concern is the ability to design local algorithms, that is, distributed algorithms in which every node (Each node is a computing entity, which has the ability to exchange messages with its neighbors in the network along its communication links.) of the network can deliver its result after having consulted only nodes in its vicinity. The word “vicinity” has a rather vague interpretation in general. Nevertheless, the objective is commonly to design algorithms in which every node outputs after having exchanged information with nodes at constant distance from it (i.e., at distance independent of the number of nodes n in the networks) or at distance at most polylogarithmic in n, but certainly significantly smaller than n or than the diameter of the network.

The tasksto be solved by distributed...


Coloring Distributed computing Maximal independent set Network computing 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Alon N, Babai L, Itai A (1986) A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4): 567–583MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Barenboim L, Elkin M (2013) Distributed graph coloring: fundamentals and recent developments. Synthesis lectures on distributed computing theory. Morgan & Claypool PublisherszbMATHGoogle Scholar
  3. 3.
    Barenboim L, Elkin M, Kuhn F (2014) Distributed (Delta+1)-coloring in linear (in delta) time. SIAM J Comput 43(1):72–95MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Barenboim L, Elkin M, Pettie S, Schneider J (2012) The locality of distributed symmetry breaking. In: Proceedings of the 53rd IEEE symposium on foundations of computer science (FOCS), New Brunswick, pp 321–330Google Scholar
  5. 5.
    Cole R, Vishkin U (1986) Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In: Proceedings of the 18th ACM symposium on theory of computing (STOC), Berkeley, pp 206–219Google Scholar
  6. 6.
    Fraigniaud P, Korman A, Peleg D (2013) Towards a complexity theory for local distributed computing. J ACM 60(5):35MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Korman A, Kutten S, Peleg D (2010) Proof labeling schemes. Distrib Comput 22(4):215–233zbMATHCrossRefGoogle Scholar
  8. 8.
    Linial N (1992) Locality in distributed graph algorithms. SIAM J Comput 21(1):193–201MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Luby M (1986) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15:1036–1053MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Naor M (1991) A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J Discret Math 4(3):409–412MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Naor M, Stockmeyer L (1995) What can be computed locally? SIAM J Comput 24(6): 1259–1277MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Panconesi A, Srinivasan A (1996) On the complexity of distributed network decomposition. J Algorithms 20(2):356–374MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM, PhiladelphiazbMATHCrossRefGoogle Scholar
  14. 14.
    Schneider J, Wattenhofer R (2010) A new technique for distributed symmetry breaking. In: Proceedings of the 29th ACM symposium on principles of distributed computing (PODC), Zurich, pp 257–266Google Scholar
  15. 15.
    Suomela J (2013) Survey of local algorithms. ACM Comput Surv 45(2):24zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Laboratoire d’Informatique Algorithmique: Fondements et Applications, CNRS and University Paris DiderotParisFrance