A Distributed Spanning Tree Algorithm
AbstractWe 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 asynchronous. 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.
How to Cite
Johansen, K. E., Jørgensen, U., Nielsen, S., Nielsen, S. E., & Skyum, S. (1987). A Distributed Spanning Tree Algorithm. DAIMI Report Series, 16(226). https://doi.org/10.7146/dpb.v16i226.7575
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.