Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149)

From MaRDI portal
Revision as of 22:17, 4 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
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
scientific article

    Statements

    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references