Parallel Flow Algorithms

Parallel Flow Algorithms is a class of parallel algorithms designed to solve network flow problems by concurrently processing multiple paths or flow augmentations, thereby exploiting inherent parallelism in flow computation to enhance computational efficiency.

190

Publications

8.4K

Citations

529

Authors

247

Institutions

Publications per year

2017–2026

24

Authors

529

  1. TE
    Tayfun E. Tezduyar

    Rice University, United States

    5 publications · 530 citations

    5

    h-index

  2. DH
    Daniel Hyams

    University of Tennessee at Chattanooga, United States

    3 publications · 95 citations

    3

    h-index

  3. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    3 publications · 103 citations

    3

    h-index

  4. JJ
    Juan J. Alonso

    Stanford University, United States

    3 publications · 94 citations

    3

    h-index

  5. RL
    Rainald Löhner

    George Mason University, United States

    3 publications · 125 citations

    3

    h-index

1–5 of 529

Venues

  1. Computers & Fluids

    12 publications · 589 citations

    11

    h-index

  2. Parallel Computing

    7 publications · 204 citations

    7

    h-index

  3. Journal of Computational Physics

    6 publications · 327 citations

    6

    h-index

  4. IEEE Transactions on Power Systems

    6 publications · 723 citations

    6

    h-index

  5. 5

    h-index

1–5