Augmenting Path Algorithms

Augmenting Path Algorithms is a class of iterative network flow methods that belong to the broader category of maximum flow algorithms, distinguished by their strategy of incrementally increasing the flow through a directed graph by identifying and augmenting along paths from the source to the sink in the residual graph.

44

Publications

9K

Citations

80

Authors

54

Institutions

Publications per year

2017–2026

3

Authors

80

  1. JS
    J.-J.E. Slotine

    Massachusetts Institute of Technology, United States

    3 publications · 275 citations

    3

    h-index

  2. DR
    David R. Karger

    Massachusetts Institute of Technology, United States

    3 publications · 72 citations

    3

    h-index

  3. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    2 publications · 119 citations

    2

    h-index

  4. EC
    Endre Csóka

    Northeastern University, United States

    2 publications · 29 citations

    2

    h-index

  5. MF
    Matthias F. Stallmann

    North Carolina State University, United States

    2 publications · 78 citations

    2

    h-index

1–5 of 80

Venues

  1. Mathematics of Operations Research

    4 publications · 224 citations

    4

    h-index

  2. Algorithmica

    2 publications · 45 citations

    2

    h-index

  3. Discrete Applied Mathematics

    2 publications · 28 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 68 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 16 citations

    1

    h-index

1–5