A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems

Authors:
Chi-Hung Tzeng;Jehn-Ruey Jiang;Shing-Tsaan Huang
Affiliations:
Department of Computer Science, National Tsing-Hua University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Central University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Central University, Taiwan, ROC
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 5

Efficient parallel algorithms for edge coloring problems

Journal of Algorithms
Coloring planar graphs in parallel

Journal of Algorithms
Improved edge-coloring algorithms for planar graphs

Journal of Algorithms
Nearly optimal distributed edge coloring in O(log log n) rounds

Random Structures & Algorithms
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

SIAM Journal on Computing
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Planar graphs of maximum degree seven are Class I

Journal of Combinatorial Theory Series B
An experimental study of a simple, distributed edge-coloring algorithm

Journal of Experimental Algorithmics (JEA)
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization
Self-stabilizing coloration in anonymous planar networks

Information Processing Letters

A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks

Information Processing Letters
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed 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
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper proposes a self-stabilizing edge-coloring algorithm using (@D+4) colors for distributed systems of a planar graph topology, where @D=5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O(n^2) moves under the central daemon model.