A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (Q4301637)
From MaRDI portal
scientific article; zbMATH DE number 617056
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs |
scientific article; zbMATH DE number 617056 |
Statements
A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (English)
0 references
10 August 1994
0 references
maximum weighted \(k\)-coloring problem
0 references
bipartite graph
0 references
