New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
From MaRDI portal
Publication:5146764
DOI10.1137/1.9781611975994.4OpenAlexW3000811701MaRDI QIDQ5146764
Robert Krauthgamer, Amir Abboud, Ohad Trabelsi
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975994.4
Related Items (2)
Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
This page was built for publication: New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
