A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring |
scientific article |
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
