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

Abstract : This paper develops linear time distributed algorithm, on general graphs, for the minimum spanning tree, in asynchronous communication network. We concentrated our efforts on the improvement of the execution time this is why our algorithm is faster than all previous linear algorithms. Our algorithm propose a solution for computing the MST in time $n/2$ with $O(n^2)$ messages (where $n=|V|$ for a graph $G=(V,E)$). The total number of messages in the worst case is slightly higher than the others algorithms, but in practice is often better.
Mots-clés :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.archives-ouvertes.fr/hal-00134604
Contributor : Franck Butelle <>
Submitted on : Friday, March 2, 2007 - 10:36:37 PM
Last modification on : Thursday, February 7, 2019 - 5:48:05 PM
Long-term archiving on : Wednesday, April 7, 2010 - 2:54:20 AM

File

BlinButelle.pdf
Publisher files allowed on an open archive

Identifiers

• HAL Id : hal-00134604, version 1

Citation

Lélia Blin, Franck Butelle. A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001, 2001, France. pp.113-124. ⟨hal-00134604⟩

Record views