Skip to main content
SpringerLink
Log in

Locality in Distributed Graph Algorithms

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 132 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  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–583

    Article  MathSciNet  MATH  Google Scholar 

  2. Barenboim L, Elkin M (2013) Distributed graph coloring: fundamentals and recent developments. Synthesis lectures on distributed computing theory. Morgan & Claypool Publishers

    MATH  Google Scholar 

  3. Barenboim L, Elkin M, Kuhn F (2014) Distributed (Delta+1)-coloring in linear (in delta) time. SIAM J Comput 43(1):72–95

    Article  MathSciNet  MATH  Google Scholar 

  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–330

    Google Scholar 

  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–219

    Google Scholar 

  6. Fraigniaud P, Korman A, Peleg D (2013) Towards a complexity theory for local distributed computing. J ACM 60(5):35

    Article  MathSciNet  MATH  Google Scholar 

  7. Korman A, Kutten S, Peleg D (2010) Proof labeling schemes. Distrib Comput 22(4):215–233

    Article  MATH  Google Scholar 

  8. Linial N (1992) Locality in distributed graph algorithms. SIAM J Comput 21(1):193–201

    Article  MathSciNet  MATH  Google Scholar 

  9. Luby M (1986) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15:1036–1053

    Article  MathSciNet  MATH  Google Scholar 

  10. Naor M (1991) A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J Discret Math 4(3):409–412

    Article  MathSciNet  MATH  Google Scholar 

  11. Naor M, Stockmeyer L (1995) What can be computed locally? SIAM J Comput 24(6): 1259–1277

    Article  MathSciNet  MATH  Google Scholar 

  12. Panconesi A, Srinivasan A (1996) On the complexity of distributed network decomposition. J Algorithms 20(2):356–374

    Article  MathSciNet  MATH  Google Scholar 

  13. Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  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–266

    Google Scholar 

  15. Suomela J (2013) Survey of local algorithms. ACM Comput Surv 45(2):24

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Pierre Fraigniaud

Authors
  1. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre Fraigniaud .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Fraigniaud, P. (2016). Locality in Distributed Graph Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_608

Download citation

Publish with us

Policies and ethics

Search

Navigation