A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs

DOI10.1007/BF01192145zbMATH Open0814.68096OpenAlexW2012703817MaRDI QIDQ4301637FDOQ4301637

Authors:

Publication date: 10 August 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192145

Recommendations

• scientific article; zbMATH DE number 4144006
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Weighted coloring: further complexity and approximability results
• Theoretical Computer Science

zbMATH Keywords

bipartite graphmaximum weighted \(k\)-coloring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Algorithms for maximumk-colorings andk-coverings of transitive graphs
• Permutation Graphs and Transitive Graphs
• On Comparability and Permutation Graphs
• Title not available (Why is that?)
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Minimax relations for the partial q-colorings of a graph
• An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
• Antichain sequences

Cited In (3)

• Algorithms for maximumk-colorings andk-coverings of transitive graphs
• Independent sets of maximum weight in (\(p,q\))-colorable graphs.
• Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs

This page was built for publication: A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs

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