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(log2 n) bits and it converges in O(n2 ) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(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(log2 n) bits.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis
• Keywords: Algorithm, Asynchronous Mst Algorithms, CORR 2010, Education, Space Complexity