A belated proof of self-stabilization
Distributed Computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A linear algorithm for five-coloring a planar graph
Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A distributed self-stabilizing algorithm for argumentation
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Self-Stabilizing Distributed Algorithms for Defeat Status Computation in Argumentation
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Linear time self-stabilizing colorings
Information Processing Letters
A self-stabilizing algorithm for bridge finding
Distributed Computing
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters
Self-stabilizing Cuts in Synchronous Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
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
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Information Processing Letters
Transformations for write-all-with-collision model
Computer Communications
Stability of Distributed Algorithms in the Face of Incessant Faults
SSS '09 Proceedings of the 11th 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
Local 7-coloring for planar subgraphs of unit disk graphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
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
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
| Hi-index | 0.00 |
This paper describes an algorithm for coloring the nodes of a planar graph with no more than six colors using a self-stabilizing approach. The first part illustrates the coloring algorithm on a directed acyclic version of the given planar graph. The second part describes a self-stabilizing algorithm for generating the directed acyclic version of the planar graph, and combines the two algorithms into one.