Preprint
Aug 2026
$\tilde{\text{O}}$ptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs
This paper presents the first distributed near-optimal $\tilde O(D)$-rounds $(1-o(1))$-approximation algorithm for Maximum $st$-Flow in general undirected planar graphs.
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
· 0 citations