A branch and bound algorithm for the maximum clique problem (Q5905591)

From MaRDI portal
Revision as of 11:01, 2 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56210435, #quickstatements; #temporary_batch_1714639695901)
scientific article; zbMATH DE number 95834
Language Label Description Also known as
English
A branch and bound algorithm for the maximum clique problem
scientific article; zbMATH DE number 95834

    Statements

    A branch and bound algorithm for the maximum clique problem (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum clique
    0 references
    unconstrained quadratic zero-one programming
    0 references
    branch-and- bound
    0 references
    0 references