An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem |
scientific article |
Statements
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (English)
0 references
1 March 2017
0 references
graph partition
0 references
graph equipartition
0 references
matrix lifting
0 references
vector lifting
0 references
semidefinite programming
0 references
