Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation |
scientific article |
Statements
Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (English)
0 references
14 December 2015
0 references
planted clique
0 references
densest subgraph
0 references
nuclear norm minimization
0 references
\(l_1\) norm minimization
0 references
0 references
0 references
0 references
