Network Flow Algorithms
Network Flow Algorithms is a class of combinatorial optimization algorithms on directed capacitated graphs that compute flows satisfying capacity and conservation constraints in order to optimize objectives such as maximizing throughput or minimizing cost between designated source and sink vertices.
5.2K
Publications
329K
Citations
9.5K
Authors
2.3K
Institutions
Publications per year
2017–2026
947
5.2K
Network Flows: Theory, Algorithms, and Applications.
David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text
Shuo Li, Raymond W. Yeung, Ning Cai · IEEE Transactions on Information Theory · 2003 · 3.5K citations
1–5 of 5.2K
9.5K
27
h-index
22
h-index
22
h-index
21
h-index
20
h-index
1–5 of 9.5K
2.3K
Massachusetts Institute of Technology
Cambridge, United States
62 h-index
255 publications
46.6K citations
University of California, Berkeley
Berkeley, United States
47 h-index
138 publications
17K citations
Princeton University
Princeton, United States
37 h-index
102 publications
14.8K citations

Cornell University
Ithaca, United States
36 h-index
96 publications
7.9K citations

University of Waterloo
Waterloo, Canada
35 h-index
117 publications
8.2K citations
Stanford University
Stanford, United States
35 h-index
125 publications
13.7K citations
Tsinghua University
Beijing, China
33 h-index
160 publications
7.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
32 h-index
123 publications
9.1K citations
1–8 of 2.3K
128 publications · 14.4K citations
64
h-index
161 publications · 9.8K citations
49
h-index
88 publications · 8.4K citations
47
h-index
142 publications · 8.3K citations
47
h-index
118 publications · 7K citations
45
h-index
1–5