New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 48-61, SIAM, 2020. [doi]

Abstract

Abstract is missing.