Pages that link to "Item:Q4609470"
From MaRDI portal
The following pages link to Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470):
Displaying 5 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- A note on convex relaxations for the inverse eigenvalue problem (Q2230796) (← links)