Sciweavers

Share
SIAMCOMP
2000

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

9 years 5 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = (log n), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + n log n). Key words. distributed algorithm, minimum weight spanning tree, lower bound AMS subject classifications. 05C85, 68Q22, 68Q25 PII. S0097539700369740
David Peleg, Vitaly Rubinovich
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where SIAMCOMP
Authors David Peleg, Vitaly Rubinovich
Comments (0)
books