TY - GEN
T1 - Fast self-stabilizing minimum spanning tree construction
T2 - 24th International Symposium on Distributed Computing, DISC 2010
AU - Blin, Lélia
AU - Dolev, Shlomi
AU - Potop-Butucaru, Maria Gradinariu
AU - Rovedakis, Stephane
PY - 2010/12/13
Y1 - 2010/12/13
N2 - 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(n 2) rounds. Thus, this algorithm improves the convergence time of all 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(logn). 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.
AB - 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(n 2) rounds. Thus, this algorithm improves the convergence time of all 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(logn). 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.
UR - http://www.scopus.com/inward/record.url?scp=78649828269&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15763-9_46
DO - 10.1007/978-3-642-15763-9_46
M3 - Conference contribution
AN - SCOPUS:78649828269
SN - 3642157629
SN - 9783642157622
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 480
EP - 494
BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings
Y2 - 13 September 2010 through 15 September 2010
ER -