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

From MaRDI portal
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
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references