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. Theory of Computing, 17:1-27, 2021. [doi]

Authors

Amir Abboud

This author has not been identified. Look up 'Amir Abboud' in Google

Robert Krauthgamer

This author has not been identified. Look up 'Robert Krauthgamer' in Google

Ohad Trabelsi

This author has not been identified. Look up 'Ohad Trabelsi' in Google