Fast Self-Stabilizing Minimum Spanning Tree Construction

Details Fast Self-Stabilizing Minimum Spanning Tree Construction Fast Self-Stabilizing Minimum Spanning Tree Construction

2010-06-16

arxiv.org/abs/1006.3141v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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 all 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.

Affiliated with

Also associated with

No associations

Rating

Fast Self-Stabilizing Minimum Spanning Tree Construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Self-Stabilizing Minimum Spanning Tree Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Self-Stabilizing Minimum Spanning Tree Construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100120