The Complexity of Multiterminal Cuts (Q4305362)

From MaRDI portal
Revision as of 17:30, 30 December 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/DahlhausJPSY94, #quickstatements; #temporary_batch_1735575912304)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    The Complexity of Multiterminal Cuts (English)
    0 references
    author
    Elias Dahlhaus
    0 references
    Mihalis Yannakakis
    0 references
    David S. Johnson
    0 references
    P. D. Seymour
    0 references
    publication date
    17 October 1994
    0 references
    zbMATH Keywords
    NP-completeness
    0 references
    network flow
    0 references
    partitioning
    0 references
    planar graphs
    0 references
    multiterminal cut problem
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    90B10
    0 references
    68R10
    0 references
    zbMATH DE Number
    638387
    0 references
    Wikidata QID
    Q56077927
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4305362&oldid=39639348"
    Powered by MediaWiki