Feasible Flow is a network flow that satisfies both capacity constraints on edges and conservation constraints at nodes, thereby representing a physically realizable assignment of flow values within a directed network.
159
Publications
13.1K
Citations
310
Authors
169
Institutions
Publications per year
2017–2026
24
Publications
159
Maximal Flow Through a Network
L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text
Faster Shortest-Path Algorithms for Planar Graphs
Monika Henzinger, Philip N. Klein, Satish Rao et al. · Journal of Computer and System Sciences · 1997 · 410 citations · Full text
1–5 of 159
Authors
310
- DR
5
h-index
- NG
4
h-index
- RK
3
h-index
- AK
3
h-index
- HS
3
h-index
1–5 of 310
Institutions
169
University of California, Berkeley
Berkeley, United States
7 h-index
9 publications
387 citations
RAND Corporation
Santa Monica, United States
5 h-index
9 publications
6.6K citations
Indian Institute of Technology Delhi
New Delhi, India
5 h-index
8 publications
358 citations
Stanford University
Stanford, United States
4 h-index
4 publications
214 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
5 publications
90 citations
University of Tehran
Tehran, Iran
3 h-index
7 publications
91 citations
UCLouvain
Louvain-la-Neuve, Belgium
3 h-index
5 publications
164 citations
University of Michigan
Ann Arbor, United States
3 h-index
4 publications
78 citations
1–8 of 169
Venues
- Networks
16 publications · 727 citations
14
h-index
- European Journal of Operational Research
8 publications · 937 citations
9
h-index
- Operations Research
8 publications · 1.2K citations
8
h-index
- Management Science
8 publications · 650 citations
8
h-index
- Transportation Science
7 publications · 471 citations
7
h-index
1–5