Strongly Polynomial Parallel Maximum Flow Revisited
This work shows that a randomized parallel implementation of a variant of the strongly polynomial max-flow algorithm of Dadush, Orlin, Sidford, and V\'egh [SODA 2026] runs in $\tilde{O}(mn)$ work and $\tilde{O}(m)$ depth, which improves upon the previously described tradeoffs between work and depth.