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

DOI10.1007/BF01192145zbMath0814.68096OpenAlexW2012703817MaRDI QIDQ4301637

No author found.

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

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

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

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