论文信息 - A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs

A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs

Abstract We present a parallel algorithm to find a minimum weighted colouring of a triangulated graph. This algorithm runs in O((log n ) 3 ) time using O( n 2 m /log n ) processors in the CRCW PRAM model.

Chính T. Hoàng

[1] Moni Naor,et al. Fast parallel algorithms for chordal graphs , 1987, STOC '87.

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] Marek Karpinski,et al. The Matching Problem for Strongly Chordal Graphs is in $NC$ , 1986 .

[4] Richard C. T. Lee,et al. Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..

[5] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6] N. Klein Philip. Efficient parallel algorithms for planar, chordal, and interval graph , 1988 .

[7] Philip N. Klein,et al. Efficient parallel algorithms for chordal graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.