Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination*
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Information Processing Letters
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Computers & Mathematics with Applications
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Constructing special k-dominating sets using variations on the greedy algorithm
Pervasive and Mobile Computing
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
An efficient self-stabilizing distance-2 coloring algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Self-stabilizing local k-placement of replicas with minimal variance
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing algorithms for efficient sets of graphs and trees
Information Processing Letters
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
Information Processing Letters
| Hi-index | 0.00 |
Self-stabilizing algorithms for optimization problems can often be solved more easily using the distance-two model in which each vertex can instantly see the state information of all vertices up to distance two. This paper presents a new technique to emulate algorithms for the distance-two model on the distance-one model using the distributed scheduler with a slowdown factor of O(m) moves. Up until now the best transformer had a slowdown factor of O(n^2m) moves. The technique is used to derive improved self-stabilizing algorithms for several graph domination problems. The paper also introduces a generalization of the distance-two model allowing a more space efficient transformer.