Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697)
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: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring |
scientific article; zbMATH DE number 881757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring |
scientific article; zbMATH DE number 881757 |
Statements
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (English)
0 references
27 May 1996
0 references
minimum vertex coloring problem
0 references
fractional coloring problem
0 references
0 references
0.8510711789131165
0 references
0.8282732367515564
0 references
0.8130810856819153
0 references
0.811398983001709
0 references
0.8087896704673767
0 references
