Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7077678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing lower bounds for minimum sum coloring and optimum cost chromatic partition |
scientific article; zbMATH DE number 7077678 |
Statements
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (English)
0 references
9 July 2019
0 references
minimum sum coloring
0 references
optimum cost chromatic partition
0 references
lower bounds
0 references
graph algorithms
0 references
graph coloring
0 references
0.8941676020622253
0 references
0.8727895617485046
0 references
0.8171573877334595
0 references
0.7842931151390076
0 references
0.779535710811615
0 references
