Fast Self-Stabilizing Minimum Spanning Tree Construction release_thm3ti4d3fc4pknnk3qtnr23jq

by Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru (LIP6, INRIA Rocquencourt), Stephane Rovedakis

Released as a article .

2010  

Abstract

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(^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 Θ(n), to the price of increasing the best known space complexity by a factor O( 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(^2n) bits.
In text/plain format

Archived Files and Locations

application/pdf  575.7 kB
file_j7swlgxnlfc6vcf4xp3abw6d5i
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-06-16
Version   v1
Language   en ?
arXiv  1006.3141v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2c367477-88bd-442e-acb3-d5d5b11d371a
API URL: JSON