All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time

Amir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak. All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023. pages 2204-2212, IEEE, 2023. [doi]

Abstract

Abstract is missing.