A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (Q4301637)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs |
scientific article; zbMATH DE number 617056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8038439154624939
0 references
0.7959280014038086
0 references
0.7955244183540344
0 references
