On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788)

From MaRDI portal
Revision as of 12:40, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 6887387
Language Label Description Also known as
English
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
scientific article; zbMATH DE number 6887387

    Statements

    On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    degree-based quasi-clique
    0 references
    quasi-clique
    0 references
    \(k\)-core
    0 references
    clique
    0 references
    clique relaxation
    0 references
    branch-and-bound
    0 references
    mixed integer programming
    0 references