The Edmonds-Karp Algorithm is a specific implementation of the Ford-Fulkerson method for solving maximum flow problems in networks, distinguished by its use of breadth-first search to select the shortest augmenting path in each iteration, thereby guaranteeing a polynomial time complexity.
68
Publications
9.8K
Citations
129
Authors
65
Institutions
Publications per year
2017–2026
4
Variants
Edmonds-karp
Parents
Publications
68
Introduction to algorithms [2nd ed.]
Thomas H. Cormen · 2001 · 1.9K citations
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
James B. Orlin · Operations Research · 1993 · 450 citations
A new approach to the maximum flow problem
Andrew V. Goldberg, Robert E. Tarjan · 1986 · 328 citations
1–5 of 68
Authors
129
- JB
4
h-index
- RE
3
h-index
- SO
2
h-index
- SR
2
h-index
- JM
2
h-index
1–5 of 129
Institutions
65
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
6 publications
1.3K citations
University of California, Berkeley
Berkeley, United States
5 h-index
8 publications
2.8K citations
Stanford University
Stanford, United States
3 h-index
5 publications
190 citations
Princeton University
Princeton, United States
3 h-index
3 publications
494 citations
Universidad de Sevilla
Seville, Spain
2 h-index
4 publications
648 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
104 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
158 citations
University of Waterloo
Waterloo, Canada
2 h-index
2 publications
2.6K citations
1–8 of 65
Venues
- Mathematical Programming
4 publications · 198 citations
4
h-index
- European Journal of Operational Research
4 publications · 372 citations
4
h-index
- Symposium on Discrete Algorithms
Conference · 2 publications · 295 citations
2
h-index
- Mathematics of Operations Research
2 publications · 71 citations
2
h-index
- Computers & Operations Research
2 publications · 135 citations
2
h-index
1–5