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

Information Processing Letters

Volumn 101, Issue 4, 2007, Pages 168-173

  Tzeng, Chi Hung ^a   Jiang, Jehn Ruey ^b   Huang, Shing Tsaan ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Distributed systems; Edge coloring; Planar graphs; Self stabilization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; TOPOLOGY;

DISTRIBUTED SYSTEMS; EDGE COLORINGS; PLANAR GRAPH TOPOLOGY; SELF STABILIZATION;

GRAPH THEORY;

EID: 33845380849     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.09.004     Document Type: Article

References (16)

1. Bruell S.C., Ghosh S., Karaata M.H., and Pemmaraju S.V. Self-stabilizing algorithms for finding centers and medians of trees. SIAM Journal of Computing 29 2 (1999) 600-614
2. Boyar J.F., and Karloff H.J. Coloring planar graphs in parallel. Journal of Algorithms 8 (1987) 470-479
3. Chrobak M., and Nishizeki T. Improved edge-coloring algorithms for planar graphs. Journal of Algorithms 11 (1990) 102-116
4. Cole R., Ost K., and Schirra S. Edge coloring bipartite multigraphs in O (E log D) time. Combinatorica 21 1 (2001) 5-12
5. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Communications of the ACM 17 (1974) 643-644
6. Gabow H.N., and Kariv O. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal on Computing 11 1 (1982) 117-129
7. Ghosh S., and Karaata M.H. A self-stabilizing algorithm for coloring planar graph. Distributed Computing 7 (1993) 55-59
8. Grable D.A., and Panconesi A. Nearly optimal distributed edge coloring in O (log log n) rounds. RSA 10 3 (1997) 385-405
9. Holyer I. The NP-completeness of edge coloring. SIAM Journal of Computing 10 4 (1981) 718-720
10. Huang S.T., Hung S.S., and Tzeng C.H. Self-stabilizing coloration in anonymous planar networks. Information Processing Letters 95 1 (2005) 307-312
11. Karloff H.J., and Shmoys D.B. Efficient parallel algorithms for edge coloring problems. Journal of Algorithms 8 (1987) 39-52
12. Marathe M.V., Panconesi A., and Risinger L.D. An experimental study of a simple, distributed edge-coloring algorithm. ACM Journal of Experimental Algorithms 9 (2004) 1-22
13. Sanders D., and Zhao Y. Planar graphs of maximum degree seven are class I. Journal of Combinatorial Theory, Series B 8 2 (2001) 201-212
14. Vizing V.G. On an estimate of the chromatic class of a p-graph. Diskret. Analiz 3 (1964) 25-30 (in Russian)
15. Vizing V.G. Critical graphs with given chromatic class. Metody Diskret. Analiz 5 (1965) 9-17 (in Russian)
16. Zhang L. Every planar graph with maximum degree 7 is of class 1. Graphs and Combinatorics 16 4 (2000) 467-495