A parallel algorithm for minimum weighted colouring of triangulated graphs

DOI10.1016/0304-3975(92)90358-MMaRDI QIDQ1193908zbMATH OpenOpenAlexFDO

Authors 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

CRCW PRAMminimum weighted colouringtriangulated graph

Mathematics Subject Classification ID

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

Recommendations

• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• A parallel algorithm for solving the coloring problem on trapezoid graphs
• Parallel vertex colouring of interval graphs
• scientific article; zbMATH DE number 1302028

Cites work

• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Fast Parallel Algorithms for Chordal Graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• Parallel Prefix Computation
• Topics on perfect graphs

Cited in

(3)

• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• A parallel algorithm for solving the coloring problem on trapezoid graphs
• scientific article; zbMATH DE number 1496856 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193908)