H-TD computes a width-3 tree decomposition of any Halin graph in linear time, and its C++ prototype outperforms PACE 2017 solvers and libtw on Halin instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
H-TD computes a width-3 tree decomposition of any Halin graph in linear time, and its C++ prototype outperforms PACE 2017 solvers and libtw on Halin instances.