Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
An efficient self-stabilizing distance-2 coloring algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
A self-stabilizing algorithm for optimally efficient sets in graphs
Information Processing Letters
| Hi-index | 0.00 |
Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general polynomial transformation for constructing self-stabilizing algorithms which utilize distance-shape k knowledge, with a slowdown of nO(log k). Our main application is a polynomial-time self-stabilizing algorithm for finding maximal irredundant sets, a problem which seems to require distance-4 information. We also show how to find maximal k-packings in polynomial-time. Our techniques extend results in a recent paper by Gairing et al. for achieving distance-two information