The Complexity of Multiterminal Cuts (Q4305362)

From MaRDI portal
scientific article; zbMATH DE number 638387
Language Label Description Also known as
English
The Complexity of Multiterminal Cuts
scientific article; zbMATH DE number 638387

    Statements

    The Complexity of Multiterminal Cuts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 1994
    0 references
    NP-completeness
    0 references
    network flow
    0 references
    partitioning
    0 references
    planar graphs
    0 references
    multiterminal cut problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references