Counting Feedback Vertex Sets of All Sizes in Subexponential Time, Conditionally
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/anthropics/formal-math
Terminology
Sources
- Solving connectivity problems parameterized by treewidth in single exponential time
- Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time
- Subexponential-time algorithms for finding large induced sparse subgraphs
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles