An \(O(IVI^3)\) algorithm for finding maximum flows in networks (Q1251587)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An \(O(IVI^3)\) algorithm for finding maximum flows in networks
scientific article

    Statements

    An \(O(IVI^3)\) algorithm for finding maximum flows in networks (English)
    0 references
    0 references
    0 references
    0 references
    1978
    0 references
    Algorithm
    0 references
    Maximum Flows in Networks
    0 references
    Blocking Flows
    0 references
    0 references
    0 references
    0 references

    Identifiers