Preprint
Aug 2026
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algorithms for many NP-hard graph combinatorial optimization problems. However, despite broad theoretical applicability, treewidth dynamic progra...
Jialiang Li, Aneta Neumann, Frank Neumann et al.
· 0 citations