A Distributed Spanning Tree Algorithm
Keyword(s):
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 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.
2011 ◽
Vol 21
(12)
◽
pp. 3151-3164
◽
Keyword(s):
1992 ◽
Vol 23
(3)
◽
pp. 1-12
◽
Keyword(s):
1998 ◽
Vol 35
(10)
◽
pp. 15-23
◽
Keyword(s):
2019 ◽
Vol 8
(3)
◽
pp. 882-889
2016 ◽
Vol 62
(4)
◽
pp. 379-388
◽
Keyword(s):