Maximum Bottleneck Flow
Maximum Bottleneck Flow is a network flow algorithm that identifies the maximum flow path in a capacitated network by iteratively augmenting along the path with the largest bottleneck capacity, distinguishing it from other flow algorithms by prioritizing throughput-maximizing routes based on minimum edge capacities in residual graphs.
16
Publications
655
Citations
36
Authors
22
Institutions
Publications per year
2017–2026
2
16
Bottlenecks and Edge Connectivity in Unsymmetrical Networks
C. P. Schnorr · SIAM Journal on Computing · 1979 · 40 citations
A unicast-based approach for streaming multicast
Rami Cohen, G. Kaempfer · 2002 · 37 citations
1–5 of 16
36
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 36
22
Case Western Reserve University
Cleveland, United States
1 h-index
1 publications
22 citations

University of Minnesota
Minneapolis, United States
1 h-index
2 publications
60 citations
University of Michigan
Ann Arbor, United States
1 h-index
2 publications
110 citations
University of Colorado Boulder
Boulder, United States
1 h-index
1 publications
194 citations
University of Science and Technology of China
Hefei, China
1 h-index
3 publications
207 citations

City University of Hong Kong
Hong Kong, Hong Kong
1 h-index
2 publications
138 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
194 citations

Goldsmiths University of London
London, United Kingdom
1 h-index
1 publications
22 citations
1–8 of 22
2 publications · 73 citations
2
h-index
JCD · 1 publications · 14 citations
1
h-index
Conference · 1 publications · 36 citations
1
h-index
1 publications · 23 citations
1
h-index
TRR · 1 publications · 23 citations
1
h-index
1–5