论文信息 - An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors

An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors

Abstract We present an efficient algorithm for edge coloring a planar graph G . Let n be the number of vertices and Δ be the maximum degree of G . If Δ ≥33, our algorithm constructs an edge coloring of G using Δ colors. The parallel implementation of the algorithm takes O (log 2 n ) time with O( n ) processors. The sequential implementation takes O( n ) time.

Xin He | Xin He

[1] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] David B. Shmoys,et al. Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.

[4] Marek Chrobak,et al. Fast Algorithms for Edge-Coloring Planar Graphs , 1989, J. Algorithms.

[5] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[6] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[7] Joan Boyar,et al. Coloring Planar Graphs in Parallel , 1987, J. Algorithms.