Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme

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 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 [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00879578
Contributor : Stephane Rovedakis <>
Submitted on : Monday, November 4, 2013 - 12:11:39 PM
Last modification on : Monday, July 22, 2019 - 11:38:09 AM
Long-term archiving on : Friday, April 7, 2017 - 8:21:25 PM

Files

SS_Label_MST.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00879578, version 1
  • ARXIV : 1311.0798

Citation

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis. Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme. [Research Report] LIP6 UMR 7606, INRIA, UPMC Sorbonne Universités, France. 2013. ⟨hal-00879578⟩

Share

Metrics

Record views

343

Files downloads

94