arXiv (All)
open access
On the Complexity of Forcing and Anti-Forcing Minimum Cuts
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 st
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers#178911
- Deconstructing Subset Construction -- Reducing While Determinizing#139164
- Opposition-based learning memetic algorithm for the maximum intersection of k-subsets problem#231625
- Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]#948660
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
Record · ID 1118004
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive