Skip to main content
Springer Nature Link
Log in

Distributed Algorithms for Minimum Spanning Trees

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 322 Accesses

Years and Authors of Summarized Original Work

  • 1983; Gallager RG, Humblet PA, Spira PM

Problem Definition

Consider a communication network, modeled by an undirected weighted graph G = (V, E), where \(\vert V \vert = n,\ \vert E\vert = m\). Each vertex of V represents a processor of unlimited computational power; the processors have unique identity numbers (ids), and they communicate via the edges of E by sending messages to each other. Also, each edge e ∈ E has associated a weight w(e), known to the processors at the endpoints of e. Thus, a processor knows which edges are incident to it and their weights, but it does not know any other information about G. The network is asynchronous:each processor runs at an arbitrary speed, which is independent of the speed of other processors. A processor may wake up spontaneously or when it receives a message from another processor. There are no failures in the network. Each message sent arrives at its destination within a finite but arbitrary...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Awerbuch B (1987) Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Proceedings of the 19th annual ACM symposium on theory of computing, New York City. ACM, New York, pp 230–240

    Google Scholar 

  2. Borůvka O (2001) Otakar Borůvka on minimum spanning tree problem (translation of both the 1926 papers, comments, history). Discret Math 233: 3–36

    Article  MATH  Google Scholar 

  3. Burns JE (1980) A formal model for message-passing systems, TR-91. Indiana University, Bloomington

    Google Scholar 

  4. Frederickson G, Lynch N (1984) The impact of synchronous communication on the problem of electing a leader in a ring. In: Proceedings of the 16th annual ACM symposium on theory of computing, Washington, DC. ACM, New York, pp 493–503

    Google Scholar 

  5. Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum-weight spanning trees. ACM Trans Prog Lang Syst 5(1): 66–77

    Article  MATH  Google Scholar 

  6. Johansen KE, Jorgensen UL, Nielsen SH (1987) A distributed spanning tree algorithm. In: Proceedings of the 2nd international workshop on distributed algorithms (DISC), Amsterdam. Lecture notes in computer science, vol 312. Springer, Berlin/Heidelberg, pp 1–12

    Google Scholar 

  7. Korach E, Moran S, Zaks S (1984) Tight upper and lower bounds for some distributed algorithms for a complete network of processors. In: Proceedings of the 3rd symposium on principles of distributed computing (PODC), Vancouver. ACM, New York, pp 199–207

    Google Scholar 

  8. Korach E, Moran S, Zaks S (1985) The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. In: Proceedings of the 4th symposium on principles of distributed computing (PODC), Minaki. ACM, New York, pp 277–286

    Google Scholar 

  9. Lotker Z, Patt-Shamir B, Pavlov E, Peleg D (2005) Minimum-weight spanning tree construction in \(O(\log \log \ n)\) communication rounds. SIAM J Comput 35(1):120–131

    Article  MathSciNet  MATH  Google Scholar 

  10. Lotker Z, Patt-Shamir B, Peleg D (2006) Distributed MST for constant diameter graphs. Distrib Comput 18(6):453–460

    Article  MATH  Google Scholar 

  11. Moses Y, Shimony B (2006) A new proof of the GHS minimum spanning tree algorithm. In: 20th international symposium on distributed computing (DISC), Stockholm, 18–20 Sept 2006. Lecture notes in computer science, vol 4167. Springer, Berlin/Heidelberg, pp 120–135

    Google Scholar 

  12. Wu BY, Chao KM (2004) Spanning trees and optimization problems. Discrete mathematics and its applications. Chapman Hall, Boca Raton

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM), 4510, México City, Mexico

    Sergio Rajsbaum

Authors
  1. Sergio Rajsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergio Rajsbaum .

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

Rajsbaum, S. (2016). Distributed Algorithms for Minimum Spanning Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_116

Download citation

Publish with us

Policies and ethics