Exact cuts in networks (Q3827810)

From MaRDI portal
Revision as of 17:43, 19 October 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
Exact cuts in networks
scientific article

    Statements

    title
    Exact cuts in networks (English)
    0 references
    author
    J. Scott Provan
    0 references
    Vidyadhar G. Kulkarni
    0 references
    published in
    Networks
    0 references
    publication date
    1989
    0 references
    zbMATH DE Number
    4102838
    0 references
    zbMATH Keywords
    exact cut
    0 references
    source-sink network
    0 references
    source-sink path
    0 references
    polynomially equivalent
    0 references
    NP-hard
    0 references
    polynomial time algorithms
    0 references
    maximum weight exact cut problem
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3827810&oldid=8257298"
      Powered by MediaWiki