Papers › A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on...
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth
Isja Mannens, Jesper Nederlof
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We give a fine-grained classification of evaluating the Tutte polynomial T(G;x,y) on all integer points on graphs with small treewidth and cutwidth. Specifically, we show for any point (x,y) ∈ℤ² that either - can be computed in polynomial time, - can be computed in 2ᴼ⁽ᵗʷ⁾nᴼ⁽¹⁾ time, but not in 2ᵒ⁽ᶜᵗʷ⁾nᴼ⁽¹⁾ time assuming the Exponential Time Hypothesis (ETH), - can be computed in 2^(O(tw logtw))nᴼ⁽¹⁾ time, but not in 2^(o(ctw logctw))nᴼ⁽¹⁾ time assuming the ETH, where we assume tree decompositions of treewidth tw and cutwidth decompositions of cutwidth ctw are given as input along with the input graph on n vertices and point (x,y). To obtain these results, we refine the existing reductions that were instrumental for the seminal dichotomy by Jaeger, Welsh and Vertigan~[Math. Proc. Cambridge Philos. Soc'90]. One of our technical contributions is a new rank bound of a matrix that indicates whether the union of two forests is a forest itself, which we use to show that the number of forests of a graph can be counted in 2ᴼ⁽ᵗʷ⁾nᴼ⁽¹⁾ time.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections