Fast Self-Stabilizing Minimum Spanning Tree Construction - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Fast Self-Stabilizing Minimum Spanning Tree Construction


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.
Fichier principal
Vignette du fichier
SS_MST_Dyn.pdf (585.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00492398 , version 1 (15-06-2010)
hal-00492398 , version 2 (21-07-2010)



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⟩
380 View
248 Download



Gmail Facebook X LinkedIn More