College of Central Florida

output

20132024

most citedParallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

7 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

G. Anagnostopoulos2 · h 24
M. Georgiopoulos2 · h 31
Arpit Agarwal1 · h 2
Chen Wang1 · h 5
Cong Li1 · h 6
Huan Li1 · h 3
Nathan White1 · h 1
Peilin Zhong1 · h 20
Prathamesh Patil1 · h 6
Sanjeev Khanna1 · h 4
Yinjie Huang1 · h 3

collaborating institutions

Cardiovascular Institute of Central FloridaUS2 papers
Columbia UniversityUS1 paper
Google (United States)US1 paper
National Defense UniversityTW1 paper
Rutgers Sexual and Reproductive Health and RightsNL1 paper

Showing cs.DSShow all

1 paper · 1 filter

cs.DS2024★ 7 cited

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

Arpit Agarwal, Sanjeev Khanna, Huan Li +4

We present a parallel algorithm for the $(1 - ε)$ -approximate maximum flow problem in capacitated, undirected graphs with $n$ vertices and $m$ edges, achieving $O(ε^{-3}\text{polylog…