Capacity Scaling Algorithms
Capacity Scaling Algorithms is a network flow algorithm that belongs to the class of scaling methods, distinguished by its strategy of progressively refining flow assignments based on successively smaller capacity thresholds to efficiently solve maximum flow problems.
41
Publications
1.9K
Citations
100
Authors
72
Institutions
Publications per year
2017–2026
7
Parents
41
Scaling algorithms for network problems
Harold N. Garbow · Journal of Computer and System Sciences · 1985 · 200 citations
1–5 of 41
100
5
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 100
72
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
436 citations
Université de Montréal
Montreal, Canada
2 h-index
4 publications
270 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
38 citations
University of Catania
Catania, Italy
2 h-index
6 publications
183 citations
Harvard University
Cambridge, United States
2 h-index
7 publications
439 citations
The University of Tokyo
Tokyo, Japan
2 h-index
3 publications
58 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
45 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
8 publications
508 citations
1–8 of 72
4 publications · 85 citations
4
h-index
3 publications · 140 citations
3
h-index
2 publications · 142 citations
2
h-index
2 publications · 35 citations
2
h-index
1 publications · 121 citations
1
h-index
1–5