All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911220110458880 |
|---|---|
| author | Kenneth-Mordoch, Yotam Krauthgamer, Robert |
| author_facet | Kenneth-Mordoch, Yotam Krauthgamer, Robert |
| contents | 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 $G=(V,E)$ with $n$ vertices, our randomized algorithm constructs a Gomory-Hu tree of $G$, and thus solves the all-pairs minimum cut problem, using $\tilde{O}(n^{7/4})$ cut queries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_16741 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries Kenneth-Mordoch, Yotam Krauthgamer, Robert Data Structures and Algorithms 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 $G=(V,E)$ with $n$ vertices, our randomized algorithm constructs a Gomory-Hu tree of $G$, and thus solves the all-pairs minimum cut problem, using $\tilde{O}(n^{7/4})$ cut queries. |
| title | All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2510.16741 |