Reproduce “Beyond Gomory-Hu: All-Pairs $\times$ All-Pairs Mincuts in $O(n)$ Space” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Koustav Bhanja, Merav Parter, Asaf Petruschka
The authors build a linear-space structure for recovering all minimum-cut separations for a queried terminal pair in an undirected connected graph with positive integer edge weights. After an O(n)-time update, it tests separability in O(1) and reports a cut in O(|C|) time. It also supports single-edge failure queries in undirected multigraphs, not multiple failures.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.