A semidefinite programming-based heuristic for graph coloring (Q2467349)
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 semidefinite programming-based heuristic for graph coloring |
scientific article; zbMATH DE number 5228810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A semidefinite programming-based heuristic for graph coloring |
scientific article; zbMATH DE number 5228810 |
Statements
A semidefinite programming-based heuristic for graph coloring (English)
0 references
21 January 2008
0 references
graph (vertex) coloring
0 references
Lovász theta number
0 references
Lovász theta function
0 references
0 references
0 references
0 references
0.94790655
0 references
0.9461044
0 references
0.9213274
0 references
0.91881406
0 references
