A semidefinite programming-based heuristic for graph coloring (Q2467349): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPLR / rank | |||
Normal rank | |||
Revision as of 01:58, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A semidefinite programming-based heuristic for graph coloring |
scientific article |
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
