Skip to main content
SpringerLink
Log in

A linear-time optimal-message distributed algorithm for minimum spanning trees

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract.

In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm can create cycles or fail to achieve optimal time complexity. We then show how to modify the algorithm to avoid these problems, and demonstrate both the correctness and optimality of the revised algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Awerbuch B: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proceedings of the 19th Symposium on Theory of Computing, 1987, pp 230-240

  2. Chin F, Ting HF: An almost linear time and O(VlogV+E) messages distributed algorithm for minimum weight spanning trees. In: Proceedings of Foundations Of Computer Science (FOCS) Conference, Portland, Oregon, 1985

  3. Faloutsos M: Corrections, improvements, simulations and optiMSTic algorithms for the distributed minimum spanning tree problem. Master’s thesis, University of Toronto, Computer Science, 1995. Master’s thesis, Technical Report CSRI-316

  4. Faloutsos M, Molle M: Optimal distributed algorithm for minimum spanning trees revisited. In: Proceedings of 1995 Principles Of Distributed Computing (PODC), 1995

  5. Faloutsos M, Molle M: What features really make distributed minimum spanning trees algorithms efficient? In: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS ‘96), Tokyo, 1996, pp 106-114

  6. Gafni E: Improvements in the time complexity of two message-optimal election algorithms. In: Proceedings of 1985 Principles of Distributed Computing (PODC), Ontario, 1985

  7. Gallager RG, Humblet PA, Spira PM: A distributed algorithm for minimum weight spanning trees. ACM Trans. on Programming Languages and Systems 5(1):66-77 (1983)

    Article  MATH  Google Scholar 

  8. Garay JA, Kutten S, Peleg D: A sub-linear time distributed algorithm for minimum-weight spanning trees. In: Proceedings of Foundations of Computer Science (FOCS), 34, 1993

  9. Kutten S, Peleg D: Fast distributed construction of k-dominating sets and applications. In: Proceedings of Principles of Distributed Computing (PODC), 1995

  10. Lynch N: Distributed Algorithms. Morgan Kaufmann, 1997

  11. Singh G, Bernstein AJ: A highly asynchronous minimum spanning tree protocol. Distributed Computing 8(3):\(\clubsuit\) (1995)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California Riverside, CA 92521, Riverside, USA

    Michalis Faloutsos & Mart Molle

Authors
  1. Michalis Faloutsos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mart Molle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michalis Faloutsos.

Additional information

Received: 9 February 2003, Accepted: 2 April 2004, Published online: 20 July 2004

Mart Molle: This material is based upon work supported by the National Science Foundation under CAREER Grant No. 9985195, and Nortel Networks and UC CoRe fund C99-14.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faloutsos, M., Molle, M. A linear-time optimal-message distributed algorithm for minimum spanning trees. Distrib. Comput. 17, 151–170 (2004). https://doi.org/10.1007/s00446-004-0107-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-004-0107-2

Keywords

Search

Navigation