The complexity of minimum cut and maximum flow problems in an acyclic network (Q3792462)

From MaRDI portal
Revision as of 14:47, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The complexity of minimum cut and maximum flow problems in an acyclic network
scientific article

    Statements

    title
    The complexity of minimum cut and maximum flow problems in an acyclic network (English)
    0 references
    published in
    Networks
    0 references
    publication date
    1987
    0 references
    zbMATH DE Number
    4057257
    0 references
    zbMATH Keywords
    minimum cut
    0 references
    maximum flow
    0 references
    acyclic network
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3792462&oldid=17354627"
    Powered by MediaWiki