Metraipolis › archive › dc_23bceca7d5fd

Directed Global Minimum Cut in Almost-Linear Time — arXiv:2610.10898

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10898
License (as archived)
CC0-1.0
Archived
2026-10-09T06:36:21.624Z
SHA-256 of the archived text
1bb416700a21a85a1e299edacaeaf299a7ff2dd6ad3ba279c1527e39a20a4924
Stable URL of this page
https://metraipolis.com/documento/dc_23bceca7d5fd

How to cite

Directed Global Minimum Cut in Almost-Linear Time — arXiv:2610.10898 — arXiv (en), https://arxiv.org/abs/2610.10898 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_23bceca7d5fd (Metraipolis archive dc_23bceca7d5fd, sha256 1bb416700a21a85a1e299edacaeaf299a7ff2dd6ad3ba279c1527e39a20a4924)
BibTeX
@misc{dc23bceca7d5fd,
  title = {Directed Global Minimum Cut in Almost-Linear Time — arXiv:2610.10898},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10898},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_23bceca7d5fd; sha256 1bb416700a21a85a1e299edacaeaf299a7ff2dd6ad3ba279c1527e39a20a4924},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10898. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a randomized reduction from global minimum cut in a directed graph with $n$ vertices and $m$ weighted edges to maximum-flow computations on graphs of total size $\widetilde{O}(m)$. For polynomially bounded integral weights, this yields the first almost-linear $m^{1+o(1)}$-time algorithm [vdBCK+23], improving the previous $m^{1+o(1)}\min\{\sqrt{n},n/m^{1/3}\}$ bound [CLN+22]. Previous work reduced finding the minimum cut to constructing a 1-respecting arborescence, a directed spanning tree with exactly one edge crossing a minimum cut [CLN+22]. They then construct such a tree by sampling from a $(1+\epsilon)$-approximate arborescence packing, which currently requires superlinear time. Our algorithm sidesteps constructing the packing entirely and relies on a novel iterative arborescence sampling procedure. We show that, after $O(\log n)$ rounds of sampling, our final arborescence 1-respects the minimum cut with constant probability.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.10898 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:57:12.698Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).