FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME (Q3888814)

From MaRDI portal
Revision as of 01:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
scientific article

    Statements

    FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    maximum flow
    0 references
    capacity modification
    0 references
    weighted minimax flow
    0 references
    binary search
    0 references
    computational complexity
    0 references
    polynomial algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references