A self-stabilizing leader election algorithm for tree graphs
Journal of Parallel and Distributed Computing
A self-stabilizing distributed algorithm to find the median of a tree graph
Journal of Computer and System Sciences
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
A Self-stabilizing Algorithm for Graph Searching in Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A memory efficient self-stabilizing algorithm for maximal k-packing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A new self-stabilizing maximal matching algorithm
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Efficient self-stabilizing graph searching in tree networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.00 |
Many proposed self-stabilizing algorithms require an exponentialnumber of moves before stabilizing on a globalsolution, including some rooting algorithms for tree networks[1, 2, 3]. These results are vastly improved upon in[6] with tree rooting algorithms that require only O(n3 +n 2 · ch) moves, where n is the number of nodes in the networkand ch is the highest initial value of a variable. Inthe current paper, we describe a new set of tree rooting algorithmsthat brings the complexity down to O(n2) moves.This not only reduces the first term by an order of magnitude,but also reduces the second term by an unboundedfactor. We further show a generic mapping that can be usedto instantiate an efficient self-stabilizing tree algorithm fromany traditional sequential tree algorithm that makes a singlebottom-up pass through a rooted tree. The new genericmapping improves on the complexity of the technique presentedin [8].