An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725)

From MaRDI portal
Revision as of 13:02, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
scientific article

    Statements

    An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (English)
    0 references
    0 references
    0 references
    24 July 2015
    0 references
    clique relaxations
    0 references
    NP-hard problems
    0 references
    fixed-parameter algorithms
    0 references
    subgraph enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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