Metraipolis › archive › dc_7d217f41deed
Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm — arXiv:2608.16382
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16382
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T00:12:42.616Z
- SHA-256 of the archived text
360913f4e9214ab5ea9e9e025f28b02f6103f32d337b31403b42f886d822f777- Stable URL of this page
https://metraipolis.com/documento/dc_7d217f41deed
How to cite
Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm — arXiv:2608.16382 — arXiv (en), https://arxiv.org/abs/2608.16382 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d217f41deed (Metraipolis archive dc_7d217f41deed, sha256 360913f4e9214ab5ea9e9e025f28b02f6103f32d337b31403b42f886d822f777)
BibTeX
@misc{dc7d217f41deed,
title = {Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm — arXiv:2608.16382},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16382},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d217f41deed; sha256 360913f4e9214ab5ea9e9e025f28b02f6103f32d337b31403b42f886d822f777},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16382. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give the first incremental algorithm for directed global minimum cut. Given a directed graph with $n$ vertices undergoing $m$ edge insertions, our deterministic algorithm explicitly maintains a global minimum cut or certifies that its value is at least $k$ in $O(km\log n)$ total update time. Prior work required either that $k\le2$ or that the graph is undirected. Our algorithm is a strict incremental extension of Gabow's state-of-the-art static algorithm (JCSS 1995), with no asymptotic loss in running time over the entire insertion sequence. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2608.16382 — 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-18T23:35:27.645Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).