A distributed spanning tree algorithm
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.
Unable to display preview. Download preview PDF.
- 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
- Korach E., Markowitz M.: Algorithms for Distributed Spanning Tree Construction in Dynamic Networks (Extended Abstract) TECHNION Technical Report #401, February 1986.Google Scholar
- 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
- 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
- Santoro N.: On the Message Complexity of Distributed Problems. Int. Journal of Comp. and Inf. Sci. 13. 1984, pages 131–147.Google Scholar