Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1987: Distributed Algorithms pp 1–12Cite as

A distributed spanning tree algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 312))

Abstract

We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well as communication is asyncronous. The total number of messages sent during a construction of a spanning tree is at most 2E+3NlogN. The maximal message size is loglogN+log(maxid)+3, where maxid is the maximal processor identity.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Francez N.: Distributed termination. ACM Trans. on Programming Languages and Systems. Vol. 2. 1980, pages 42–55.

    Article  Google Scholar 

  2. Gallager R. G., Humblet P. A., Spira P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. on Programming Languages and Systems. Vol. 5. 1983, pages 66–77.

    Article  Google Scholar 

  3. Humblet P. A.: A Distributed Algorithm for Minimum Weight Directed Spanning Trees. IEEE Trans. on Communications. Vol 31. 1983, pages 756–762.

    Article  Google Scholar 

  4. Johansen K.E., Jørgensen U. L., Nielsen S. H., Nielsen S. E.: Konstruktion og analyse af distibuerede algoritmer til beregning af et udspændende træ. (In Danish) Technical report, March 1986, Aarhus University.

    Google Scholar 

  5. Korach E., Markowitz M.: Algorithms for Distributed Spanning Tree Construction in Dynamic Networks (Extended Abstract) TECHNION Technical Report #401, February 1986.

    Google Scholar 

  6. Korach E., Moran S., Zaks S.: Tight Lower and Upper Bounds for some Distributed Algorithms for a Complete Network of Processors, Proc. of 3. Ann ACM PODC 1984, pages. 199–207.

    Google Scholar 

  7. Korach E., Moran S., Zaks S.: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. Proc. of 4. Ann. ACM PODC, Ontario 1985, pages 277–286.

    Google Scholar 

  8. Lavellee I., Roucairol G.: A Fully Distributed (Minimal) Spanning Tree Algorithm. Inf. Proc. Letters 23. 1986, pages 55–62.

    Article  Google Scholar 

  9. Santoro N.: On the Message Complexity of Distributed Problems. Int. Journal of Comp. and Inf. Sci. 13. 1984, pages 131–147.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark

    Karl Erik Johansen, Ulla Lundin Jørgensen, Svend Hauge Nielsen, Søren Erik Nielsen & Sven Skyum

Authors
  1. Karl Erik Johansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulla Lundin Jørgensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Svend Hauge Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Søren Erik Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sven Skyum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johansen, K.E., Jørgensen, U.L., Nielsen, S.H., Nielsen, S.E., Skyum, S. (1988). A distributed spanning tree algorithm. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019790

Download citation

  • DOI: https://doi.org/10.1007/BFb0019790

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

  • Online ISBN: 978-3-540-39239-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation