Fast self-stabilizing minimum spanning tree construction: Using compact nearest common ancestor labeling scheme

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages480-494
Number of pages15
DOIs
StatePublished - 13 Dec 2010
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: 13 Sep 201015 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA
Period13/09/1015/09/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Fast self-stabilizing minimum spanning tree construction: Using compact nearest common ancestor labeling scheme'. Together they form a unique fingerprint.

Cite this