A semidefinite programming-based heuristic for graph coloring (Q2467349): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.07.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043473394 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 March 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
