Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1572312821 / rank
 
Normal rank

Revision as of 03:19, 20 March 2024

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references