An analytic symmetrization of max flow-min cut (Q1356775)

From MaRDI portal
Revision as of 11:50, 19 July 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
An analytic symmetrization of max flow-min cut
scientific article

    Statements

    An analytic symmetrization of max flow-min cut (English)
    0 references
    0 references
    0 references
    10 June 1997
    0 references
    maximum capacitated \((s,t)\)-flow problem
    0 references
    minimum weighted \((s,t)\)-cut problem
    0 references
    directed network
    0 references
    max flow-min cut theorem for undirected graphs
    0 references

    Identifiers