An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:19, 3 February 2024
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
