Metraipolis › archive › dc_50021c9716da
On the Complexity of Forcing and Anti-Forcing Minimum Cuts — arXiv:2609.33292
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33292
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:18:58.883Z
- SHA-256 of the archived text
10a5b10152a7b2d83f2903e7a94da9c7b6b5cad6fcd048e091c7a28d6e172061- Stable URL of this page
https://metraipolis.com/documento/dc_50021c9716da
How to cite
On the Complexity of Forcing and Anti-Forcing Minimum Cuts — arXiv:2609.33292 — arXiv (en), https://arxiv.org/abs/2609.33292 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_50021c9716da (Metraipolis archive dc_50021c9716da, sha256 10a5b10152a7b2d83f2903e7a94da9c7b6b5cad6fcd048e091c7a28d6e172061)
BibTeX
@misc{dc50021c9716da,
title = {On the Complexity of Forcing and Anti-Forcing Minimum Cuts — arXiv:2609.33292},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33292},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_50021c9716da; sha256 10a5b10152a7b2d83f2903e7a94da9c7b6b5cad6fcd048e091c7a28d6e172061},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33292. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For an instance of a combinatorial optimization problem, a \emph{forcing set} is a set of elements such that there is a unique optimal solution including it. Symmetrically, an \emph{anti-forcing set} is a set of elements such that there is a unique optimal solution excluding it. In this paper, we study the problems of computing smallest forcing and anti-forcing sets for two classical cut problems, \textsc{Global Min Cut} and \textsc{Min $s$--$t$ Cut}. We also consider variants in which the optimal cut to be uniquely determined is given as input. For each of these problems, we either give a polynomial-time algorithm or prove \NP-completeness.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.33292 — 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-07T23:56:21.764Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).