Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation (Q4609470)
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: Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation |
scientific article; zbMATH DE number 6855328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0.7956218719482422
0 references
0.7724273800849915
0 references
0.7417511343955994
0 references
0.7252454161643982
0 references
0.7203957438468933
0 references
