Maximum Flow

Maximum Flow is a network optimization problem that belongs to the class of flow problems in graph theory, distinguished by its objective to determine the greatest possible flow that can be routed from a source node to a sink node in a flow network while respecting edge capacity constraints and flow conservation laws.

1.5K

Publications

86.2K

Citations

3.9K

Authors

1.4K

Institutions

Publications per year

2017–2026

237

Authors

3.9K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    15 publications · 5.8K citations

    14

    h-index

  2. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    15 publications · 1.2K citations

    14

    h-index

  3. AV
    Andrew V. Goldberg

    Stanford University, United States

    14 publications · 3.8K citations

    13

    h-index

  4. ÉT
    Éva Tardos

    Cornell University, United States

    12 publications · 1.4K citations

    12

    h-index

  5. RK
    Ravindra K. Ahuja

    University of Florida, United States

    12 publications · 847 citations

    11

    h-index

1–5 of 3.9K

Venues

  1. Operations Research

    34 publications · 4.1K citations

    28

    h-index

  2. SIAM Journal on Computing

    26 publications · 3.8K citations

    23

    h-index

  3. Networks

    42 publications · 1.4K citations

    21

    h-index

  4. Mathematics of Operations Research

    21 publications · 1.5K citations

    17

    h-index

  5. Neurourology and Urodynamics

    18 publications · 915 citations

    16

    h-index

1–5