Network Flows
Network Flows is a branch of combinatorial optimization and graph theory that models and analyzes the movement of a conserved quantity through a directed, typically capacitated network subject to capacity and flow-conservation constraints between specified source and sink vertices.
5.2K
Publications
332.1K
Citations
9.6K
Authors
2.3K
Institutions
Publications per year
2017–2026
950
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
Stephen P. Borgatti · Social Networks · 2005 · 3.1K citations
Network flows: Theory, algorithms and applications
Discrete Applied Mathematics · 1994 · 2.6K citations
1–5 of 5.2K
9.6K
28
h-index
23
h-index
21
h-index
National Taiwan University of Science and Technology, Taiwan
35 publications · 1.4K citations
20
h-index
20
h-index
1–5 of 9.6K
2.3K
Massachusetts Institute of Technology
Cambridge, United States
70 h-index
280 publications
47.8K citations

Cornell University
Ithaca, United States
44 h-index
131 publications
11K citations
Princeton University
Princeton, United States
43 h-index
129 publications
13.3K citations
University of California, Berkeley
Berkeley, United States
43 h-index
138 publications
13.5K citations

Centre National de la Recherche Scientifique
Paris, France
36 h-index
174 publications
8.7K citations
Georgia Institute of Technology
Atlanta, United States
35 h-index
150 publications
6.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
35 h-index
128 publications
10K citations
Stanford University
Stanford, United States
35 h-index
116 publications
10.2K citations
1–8 of 2.3K
93 publications · 10.9K citations
51
h-index
157 publications · 8.6K citations
48
h-index
138 publications · 7.6K citations
44
h-index
77 publications · 6.1K citations
44
h-index
TON · 85 publications · 11.2K citations
41
h-index
1–5