Maximum Flow Algorithms is a class of graph algorithms that determine the greatest possible flow from a source to a sink in a flow network while respecting edge capacity constraints.
503
Publications
39.6K
Citations
835
Authors
409
Institutions
Publications per year
2017–2026
69
Parents
Publications
503
Maximal Flow Through a Network
L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text
Energy conserving routing in wireless ad-hoc networks
Jae-Hwan Chang, Leandros Tassiulas · 2002 · 1.7K citations
1–5 of 503
Authors
835
- RE
14
h-index
- AV
13
h-index
- PN
11
h-index
- RP
10
h-index
- ÉT
10
h-index
1–5 of 835
Institutions
409
Massachusetts Institute of Technology
Cambridge, United States
22 h-index
31 publications
6.3K citations
Stanford University
Stanford, United States
18 h-index
32 publications
1.8K citations
Tel Aviv University
Tel Aviv, Israel
18 h-index
27 publications
911 citations
University of California, Berkeley
Berkeley, United States
18 h-index
30 publications
5.3K citations
Princeton University
Princeton, United States
16 h-index
24 publications
6.3K citations
Georgia Institute of Technology
Atlanta, United States
16 h-index
28 publications
1.2K citations
Cornell University
Ithaca, United States
13 h-index
14 publications
1.2K citations
Columbia University
New York, United States
13 h-index
15 publications
1K citations
1–8 of 409
Venues
- SIAM Journal on Computing
24 publications · 3.4K citations
21
h-index
- Networks
27 publications · 775 citations
18
h-index
- Operations Research
17 publications · 3K citations
17
h-index
- Mathematics of Operations Research
18 publications · 1.1K citations
16
h-index
- Information Processing Letters
11 publications · 553 citations
11
h-index
1–5