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

Authors

36

  1. SP
    Seth Pettie

    University of Michigan, United States

    2 publications · 91 citations

    2

    h-index

  2. AP
    Abraham P. Punnen

    University of New Brunswick, Canada

    2 publications · 34 citations

    2

    h-index

  3. JZ
    Jun Zhang

    University of Science and Technology of China, China

    1 publications · 69 citations

    1

    h-index

  4. RZ
    Ruonan Zhang

    Northwestern Polytechnical University, China

    1 publications · 11 citations

    1

    h-index

  5. PI
    Pétros Ioannou

    University of Southern California, United States

    1 publications · 14 citations

    1

    h-index

1–5 of 36

Venues

  1. SIAM Journal on Computing

    2 publications · 73 citations

    2

    h-index

  2. Journal of Control and Decision

    JCD · 1 publications · 14 citations

    1

    h-index

  3. 1

    h-index

  4. Computing

    1 publications · 23 citations

    1

    h-index

  5. 1

    h-index

1–5