arXiv (All)
open access
Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
Important separators reduce the search space in parameterized graph separation to a small family that can be enumerated efficiently. We extend this approach to cut-uncut problems, which require separating some vertices while keeping a prescribed terminal set connected. We introduce connectivity-pr
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
- Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances#1341751
- Expander Hierarchies for Normalized Cuts on Graphs#163040
- Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes#1357018
- A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees#1326266
- Compact Partial Symmetry Breaking for Graph Search Problems#1035952
Record · ID 1233740
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