613 search results - page 1 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
FSTTCS
1993
Springer
15 years 3 months ago
1993
Springer
SOFSEM
1997
Springer
15 years 3 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...
105
click to vote
PRDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
CORR
2010
Springer
14 years 10 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...
115
click to vote
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...