Finding and certifying a large hidden clique in a semirandom graph (Q4948021)

From MaRDI portal
Revision as of 00:33, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56210408, #quickstatements; #temporary_batch_1726270021205)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1436004
Language Label Description Also known as
English
Finding and certifying a large hidden clique in a semirandom graph
scientific article; zbMATH DE number 1436004

    Statements

    0 references
    0 references
    13 July 2000
    0 references
    semirandom graph
    0 references
    largest clique
    0 references
    maximum clique problem
    0 references
    theta function
    0 references
    hidden clique
    0 references
    Finding and certifying a large hidden clique in a semirandom graph (English)
    0 references

    Identifiers