A parallel algorithm for minimum weighted colouring of triangulated graphs

DOI10.1016/0304-3975(92)90358-MzbMath0761.68073OpenAlexW2093115550MaRDI QIDQ1193908

Chính T. Hoàng

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90358-m

zbMATH Keywords

triangulated graphCRCW PRAMminimum weighted colouring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Fast Parallel Algorithms for Chordal Graphs
• Parallel Prefix Computation

This page was built for publication: A parallel algorithm for minimum weighted colouring of triangulated graphs