论文信息 - Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs

Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs

Abstract This paper presents parallel algorithms for coloring a constant-degree graph with a maximum degree of Δ using Δ + 1 colors and for finding a maximal independent set in a constant-degree graph. Given a graph with n vertices, the algorithms run in O(lg∗n) time on an EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in a distributed model of parallel computation.

Andrew V. Goldberg | Serge A. Plotkin | A. Goldberg

[1] Serge A. Plotkin,et al. Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems , 1987 .

[2] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[3] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.

[4] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[5] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[6] Richard Cole,et al. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.