Maximum Flow
Maximum Flow is a network optimization problem that belongs to the class of flow problems in graph theory, distinguished by its objective to determine the greatest possible flow that can be routed from a source node to a sink node in a flow network while respecting edge capacity constraints and flow conservation laws.
1.5K
Publications
86.2K
Citations
3.9K
Authors
1.4K
Institutions
Publications per year
2017–2026
237
1.5K
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 1.5K
3.9K
14
h-index
14
h-index
13
h-index
12
h-index
11
h-index
1–5 of 3.9K
1.4K
Massachusetts Institute of Technology
Cambridge, United States
36 h-index
97 publications
11.1K citations

Cornell University
Ithaca, United States
22 h-index
49 publications
4.9K citations
Columbia University
New York, United States
21 h-index
33 publications
2K citations
Stanford University
Stanford, United States
21 h-index
51 publications
3.2K citations
University of California, Berkeley
Berkeley, United States
20 h-index
39 publications
3.9K citations
Georgia Institute of Technology
Atlanta, United States
18 h-index
32 publications
2.5K citations

Tel Aviv University
Tel Aviv, Israel
18 h-index
25 publications
862 citations
Princeton University
Princeton, United States
18 h-index
32 publications
7.4K citations
1–8 of 1.4K
34 publications · 4.1K citations
28
h-index
26 publications · 3.8K citations
23
h-index
42 publications · 1.4K citations
21
h-index
21 publications · 1.5K citations
17
h-index
18 publications · 915 citations
16
h-index
1–5