Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (Q4458884)

From MaRDI portal
Revision as of 16:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2055959
Language Label Description Also known as
English
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
scientific article; zbMATH DE number 2055959

    Statements

    Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Approximation algorithms
    0 references
    Multicut
    0 references
    Polynomial-time approximation schemes
    0 references
    Tree-width
    0 references

    Identifiers

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