The following publications are possibly variants of this publication:
- Subcubic algorithms for Gomory-Hu tree in unweighted graphsAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. stoc 2021: 1725-1737 [doi]
- All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear TimeAmir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak. focs 2023: 2204-2212 [doi]
- Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic TimeAmir Abboud, Robert Krauthgamer, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi. focs 2022: 884-895 [doi]