79 search results - page 1 / 16 » Fast Self-Stabilizing Minimum Spanning Tree Construction |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
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(n2 ) round...
WDAG
2001
Springer
14 years 2 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
PODC
1997
ACM
14 years 2 months ago
1997
ACM
OPODIS
2001
13 years 11 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
SOFSEM
1997
Springer
14 years 1 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...