Locality in distributed graph algorithms
SIAM Journal on Computing
A self-stabilizing algorithm for maximal matching
Information Processing Letters
ACM Computing Surveys (CSUR)
A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Maximal matching stabilizes in quadratic time
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Resource Bounds for Self-Stabilizing Message-Driven Protocols
SIAM Journal on Computing
Self-stabilizing routing and related protocols
Journal of Parallel and Distributed Computing
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
Maximal matching stabilizes in time O(m)
Information Processing Letters
Dynamic and self-stabilizing distributed matching
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
On the b-Chromatic Number of Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set
IEEE Transactions on Parallel and Distributed Systems
Linear time self-stabilizing colorings
Information Processing Letters
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination*
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters
Information Processing Letters
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Computers & Mathematics with Applications
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A new self-stabilizing maximal matching algorithm
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A self-stabilizing weighted matching algorithm
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing algorithm for the minimum color sum of a graph
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Self-stabilizing algorithms for graph coloring with improved performance guarantees
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
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 |
Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the concept of self-stabilization received little attention when it was introduced, it has become one of the most popular fault tolerance approaches. On the other hand, graph algorithms form the basis of many network protocols. They are used in routing, clustering, multicasting and many other tasks. The objective of this paper is to survey the self-stabilizing algorithms for dominating and independent set problems, colorings, and matchings. These graph theoretic problems are well studied in the context of self-stabilization and a large number of algorithms have been proposed for them.