A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076)

From MaRDI portal
Revision as of 01:10, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A new Karzanov-type \(O(n^ 3)\) max-flow algorithm
scientific article

    Statements

    A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    maximum value flows
    0 references
    directed single commodity networks
    0 references
    maximal flow
    0 references
    phase algorithms
    0 references
    layered networks
    0 references
    0 references