Computational Comparison of Eight Methods for the Maximum Network Flow Problem (Q3870686)

From MaRDI portal
Revision as of 21:49, 19 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
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
scientific article

    Statements

    Computational Comparison of Eight Methods for the Maximum Network Flow Problem (English)
    0 references
    0 references
    1980
    0 references
    computational comparison of eight methods
    0 references
    maximum network flow problem
    0 references
    depth-first search
    0 references
    breadth-first search
    0 references
    largest-augmentation
    0 references
    layer- updating
    0 references
    Karzanov algorithm
    0 references
    Kinariwala-Rao algorithm
    0 references
    flow augmentation along paths
    0 references
    flow augmentation through layers
    0 references
    Dinic algorithm
    0 references
    comparison of algorithms
    0 references

    Identifiers

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