A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
Self-stabilizing Cuts in Synchronous Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A self-stabilizing algorithm for the st-order problem
International Journal of Parallel, Emergent and Distributed Systems
Fault tolerance in wireless sensor networks through self-stabilisation
International Journal of Communication Networks and Distributed Systems
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
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
Journal of Parallel and Distributed Computing
A self-stabilizing algorithm for cut problems in synchronous networks
Theoretical Computer Science
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
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
OPODIS'10 Proceedings of the 14th 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 distributed algorithm for a b-coloring of a graph
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
An efficient self-stabilizing distance-2 coloring algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An efficient self-stabilizing distance-2 coloring algorithm
Theoretical Computer Science
An incremental distributed algorithm for a partial Grundy coloring of graphs
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
| Hi-index | 0.89 |
We propose two new self-stabilizing distributed algorithms for proper Δ + 1 (Δ is the maximum degree of a mode in the graph) colorings of arbitrary system graphs. Both algorithms are capable of working with multiple type of daemons (schedulers) as is the most recent algorithm by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 55-70]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes and m is the number of edges in the graph) as opposed to the O(Δ × n) moves required by the algorithm by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 55-70]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of Δ, as is required by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 55-70]. Further, the coloring produced by our first algorithm provides an interesting type of coloring, called a Grundy Coloring [Jensen and Toft, Graph Coloring Problems, 1995].