Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: COL / rank | |||
Normal rank | |||
Revision as of 13:03, 28 February 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
