Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 15:57, 28 February 2024
scientific article; zbMATH DE number 6855328
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation |
scientific article; zbMATH DE number 6855328 |
Statements
Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (English)
0 references
3 April 2018
0 references
convex optimization
0 references
distance-regular graphs
0 references
induced subgraph isomorphism
0 references
majorization
0 references
orbitopes
0 references
semidefinite programming
0 references
strongly regular graphs
0 references
