Two-phase Flow Algorithms

Two-Phase Flow Algorithms is a network flow algorithm that belongs to the class of methods designed for solving maximum flow problems, distinguished by its systematic separation of the flow computation into two distinct stages—first establishing a feasible flow and then augmenting it to optimality—thereby improving efficiency and correctness in specific flow network scenarios.

99

Publications

12.3K

Citations

271

Authors

135

Institutions

Publications per year

2017–2026

21

Authors

271

  1. MS
    Mark Sussman

    Florida State University, United States

    3 publications · 5.6K citations

    3

    h-index

  2. PS
    Peter Smereka

    University of Michigan, United States

    2 publications · 5.5K citations

    2

    h-index

  3. HZ
    Hongbin Zhang

    Idaho National Laboratory, United States

    2 publications · 54 citations

    2

    h-index

  4. ME
    Matthias Ehrgott

    University of Auckland, New Zealand

    2 publications · 152 citations

    2

    h-index

  5. NM
    Norberto Mangiavacchi

    Universidade do Estado do Rio de Janeiro, Brazil

    2 publications · 47 citations

    2

    h-index

1–5 of 271

Venues

  1. Journal of Computational Physics

    24 publications · 7.5K citations

    22

    h-index

  2. International Journal of Multiphase Flow

    7 publications · 603 citations

    7

    h-index

  3. Computers & Fluids

    6 publications · 1K citations

    6

    h-index

  4. 4

    h-index

  5. 4

    h-index

1–5