We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log 2 n) 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 Θ(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 2 n) bits. * A preliminary version of this paper has appeared
The fastest protocol given in REF constructs an MST in O(N 2 ) rounds where N is the number of nodes.
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
ArXiv
ArXiv
Computer Science Mathematics