Sciweavers

Share
OPODIS
2001

A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree

8 years 6 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhance their basic algorithm. Most of these improved algorithms have been shown to be very efficient in terms of reducing their worst-case communication and/or time complexity measures. In this paper, we address the problem of MST construction on general graphs. We present a new distributed algorithm for constructing the MST, which is linear in time and is faster than all previous linear algorithms. This algorithm is not to be compared with sublinear algorithms constructed on special graphs (graph diameter in order of log n) [5, 6].
Lélia Blin, Franck Butelle
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where OPODIS
Authors Lélia Blin, Franck Butelle
Comments (0)
books