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

Arpit Agarwal, Sanjeev Khanna, Huan Li 0002, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong. Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 3997-4061, SIAM, 2024. [doi]

Abstract

Abstract is missing.