论文信息 - Self-stabilizing coloration in anonymous planar networks - 字舞流文

Self-stabilizing coloration in anonymous planar networks

Shing-Tsaan Huang | Chi-Hung Tzeng | Su-Shen Hung | Chi-Hung Tzeng | Shing-Tsaan Huang | Su-Shen Hung

[1] Edsger W. Dijkstra,et al. Self-stabilizing systems in spite of distributed control , 1974, CACM.

[2] Pradip K. Srimani,et al. A self-stabilizing algorithm for coloring bipartite graphs , 1993, Inf. Sci..

[3] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[4] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .

[5] Amos Israeli,et al. Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[6] Sébastien Tixeuil,et al. Self-stabilizing Vertex Coloring of Arbitrary Graphs , 2000 .

[7] Pradip K. Srimani,et al. Linear time self-stabilizing colorings , 2003, Inf. Process. Lett..

[8] Mehmet Hakan Karaata,et al. A self-stabilizing algorithm for coloring planar graphs , 2005, Distributed Computing.