On real-world graphs, treewidth is typically near n/10 while vertex cover is near n/2, making treewidth-based exponential algorithms far more practical than vertex-cover-based ones.
Half-integrality, LP- branching, and FPT algorithms.SIAM Journal on Computing, 45(4):1377–1411
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Parameter Report: An Orientation Guide for Data-Driven Parameterization
On real-world graphs, treewidth is typically near n/10 while vertex cover is near n/2, making treewidth-based exponential algorithms far more practical than vertex-cover-based ones.