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
Parents
44
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text
1–5 of 44
80
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 80
54
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
9 publications
2.5K citations
University of California, Berkeley
Berkeley, United States
3 h-index
6 publications
1.9K citations
Stanford University
Stanford, United States
2 h-index
2 publications
120 citations
University of Colorado Boulder
Boulder, United States
2 h-index
3 publications
88 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
71 citations

University of Warwick
Coventry, United Kingdom
2 h-index
2 publications
29 citations
North Carolina State University
Raleigh, United States
2 h-index
2 publications
78 citations
Open University of Israel
Raanana, Israel
2 h-index
2 publications
35 citations
1–8 of 54
4 publications · 224 citations
4
h-index
2 publications · 45 citations
2
h-index
2 publications · 28 citations
2
h-index
2 publications · 68 citations
2
h-index
Repository · 1 publications · 16 citations
1
h-index
1–5