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

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi (2020)

Details and statistics

DOI: 10.1137/1.9781611975994.4

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-15

a service of  Schloss Dagstuhl - Leibniz Center for Informatics