Path Decompositions of Sparse Graphs via Gaussian Sweeps and Faster Exponential Algorithms
cs.DS, cs.DM, math.CO
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/anthropics/formal-math
Project page: https://serggasp.github.io/pathwidth-site
Terminology
Sources
- Multiplying matrices via polynomials: exposition and barriers
- Tight Bounds for Connectivity Problems Parameterized by Cutwidth
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- Spotting Trees with Few Leaves
- Faster Graph Coloring in Polynomial Space
- Exact Algorithms via Multivariate Subroutines
- Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets
- The Asymmetric Travelling Salesman Problem in Sparse Digraphs
- Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time
- Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of omega 9/4
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- 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