Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457): 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.1007/s10107-006-0026-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144606698 / rank | |||
Normal rank | |||
Revision as of 00:50, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming relaxations for graph coloring and maximal clique problems |
scientific article |
Statements
Semidefinite programming relaxations for graph coloring and maximal clique problems (English)
0 references
5 March 2007
0 references
Lovász theta number
0 references
chromatic number
0 references
clique number
0 references
cutting planes
0 references
