Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191)
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: Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8973763585090637
0 references
0.8179640173912048
0 references
0.7956218719482422
0 references
0.7944280505180359
0 references
