No article text was recorded for this version.
all-pairs min-cut complexity
Version 1 of 110 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Cut-Equivalent Trees are Optimal for Min-Cut Queries
- Blog: A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs
- Blog: Approximate Gomory-Hu tree is faster than n - 1 max-flows
- Blog: Cut Tree Construction from Massive Graphs
- Blog: Deterministic Min-cut in Poly-logarithmic Max-flows
- Blog: Edge Connectivity Augmentation in Near-Linear Time
- Blog: Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time
- Blog: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
- Blog: Friendly Cut Sparsifiers and Faster Gomory-Hu Trees
- Blog: APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time
History & citation
Current · Permanent link
- This direction split from The Algorithmic Cost of Numerical Weights (60% overlap)
- This direction split from Near-Linear Time Algorithms for Global Graph Connectivity (60% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_all_pairs_min_cut_complexity_ea610dc4,
title = {all-pairs min-cut complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-pairs-min-cut-complexity/rdr_ea610dc4549244749e8c0584c32b3800},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_all_pairs_min_cut_complexity_ea610dc4_v1,
title = {all-pairs min-cut complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-pairs-min-cut-complexity/rdr_ea610dc4549244749e8c0584c32b3800/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}