Improving the performance guarantee for approximate graph coloring (Q3763600)
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 4020494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the performance guarantee for approximate graph coloring |
scientific article; zbMATH DE number 4020494 |
Statements
Improving the performance guarantee for approximate graph coloring (English)
0 references
1983
0 references
NP-completeness
0 references
performance guarantee of a graph coloring algorithm
0 references
number of colors
0 references
chromatic number
0 references
0.98421985
0 references
0.9719956
0 references
0.91593564
0 references
0.9155896
0 references
0.9126982
0 references
0.90794396
0 references
