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
Parents
190
Parallel finite-element computation of 3D flows
Tayfun E. Tezduyar, S. Aliabadi, Marek Behr et al. · Computer · 1993 · 283 citations
A fast distributed implementation of optimal power flow
Ross Baldick, B.H. Kim, C. Chase et al. · IEEE Transactions on Power Systems · 1999 · 232 citations
An O(n2log n) parallel max-flow algorithm
Yossi Shiloach, Uzi Vishkin · Journal of Algorithms · 1982 · 226 citations
1–5 of 190
529
5
h-index
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 103 citations
3
h-index
3
h-index
3
h-index
1–5 of 529
247
Stanford University
Stanford, United States
7 h-index
15 publications
400 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
10 publications
1K citations
The University of Texas at Austin
Austin, United States
5 h-index
10 publications
1.6K citations
Tsinghua University
Beijing, China
5 h-index
17 publications
402 citations
Purdue University West Lafayette
West Lafayette, United States
5 h-index
11 publications
253 citations
University of California, Irvine
Irvine, United States
3 h-index
5 publications
176 citations

Chinese Academy of Sciences
Beijing, China
3 h-index
11 publications
248 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
5 publications
185 citations
1–8 of 247
12 publications · 589 citations
11
h-index
7 publications · 204 citations
7
h-index
6 publications · 327 citations
6
h-index
6 publications · 723 citations
6
h-index
5 publications · 359 citations
5
h-index
1–5