Fast Self-Stabilizing Minimum Spanning Tree Construction

Abstract : We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only $O(\log^2n)$ bits.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00492398
Contributor : Stephane Rovedakis <>
Submitted on : Wednesday, July 21, 2010 - 10:29:35 AM
Last modification on : Monday, January 13, 2020 - 12:10:19 PM
Long-term archiving on: Friday, October 22, 2010 - 4:13:36 PM

Files

SS_MST_Dyn.pdf
Files produced by the author(s)

Identifiers

Citation

Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis. Fast Self-Stabilizing Minimum Spanning Tree Construction. DISC 2010 - 24th International Symposium on Distributed Computing, Sep 2010, Cambridge, MA, United States. pp.480-494, ⟨10.1007/978-3-642-15763-9_46⟩. ⟨hal-00492398v2⟩

Share

Metrics

Record views

561

Files downloads

299