All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
Data Structures and Algorithms
2025-10-21 v1
Abstract
We present the first non-trivial algorithm for the all-pairs minimum cut problem in the cut-query model. Given cut-query access to an unweighted graph with vertices, our randomized algorithm constructs a Gomory-Hu tree of , and thus solves the all-pairs minimum cut problem, using cut queries.
Keywords
Cite
@article{arxiv.2510.16741,
title = {All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries},
author = {Yotam Kenneth-Mordoch and Robert Krauthgamer},
journal= {arXiv preprint arXiv:2510.16741},
year = {2025}
}