Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129)
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: Semidefinite programming and eigenvalue bounds for the graph partition problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite programming and eigenvalue bounds for the graph partition problem |
scientific article |
Statements
Semidefinite programming and eigenvalue bounds for the graph partition problem (English)
0 references
19 June 2015
0 references
graph partition problem
0 references
semidefinite programming
0 references
eigenvalues
0 references
strongly regular graph
0 references
symmetry
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8683990836143494
0 references
0.8346870541572571
0 references
0.8235804438591003
0 references
0.8206308484077454
0 references
