Finding one community in a sparse graph (Q892403)

From MaRDI portal
Revision as of 23:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding one community in a sparse graph
scientific article

    Statements

    Finding one community in a sparse graph (English)
    0 references
    19 November 2015
    0 references
    random graphs
    0 references
    cavity method
    0 references
    statistical inference
    0 references
    hidden clique
    0 references
    polynomial algorithms
    0 references
    phase transitions
    0 references
    0 references

    Identifiers

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