A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7241656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring |
scientific article; zbMATH DE number 7241656 |
Statements
A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (English)
0 references
28 August 2020
0 references
semidefinite programming
0 references
relaxation hierarchy
0 references
max-cut
0 references
stable set
0 references
coloring
0 references
0 references
0 references
0 references
0 references
0.93501877784729
0 references
0.8235244154930115
0 references
0.8031444549560547
0 references
0.800223171710968
0 references
0.7976389527320862
0 references
