Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405)

From MaRDI portal
Revision as of 21:29, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
scientific article

    Statements

    Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    linear programming
    0 references
    \(k\)-cardinality tree
    0 references
    tree decomposition
    0 references
    heuristics
    0 references
    bioinformatics
    0 references
    gene regulation
    0 references

    Identifiers