Abstract
We analyze the computational effectiveness of the graph reductions proposed by Sanders [12,13] to recognize graphs of treewidth at most four. We show that graphs of treewidth at most four can be recognized extremely fast by this infinite set of reductions. For graphs of larger treewidth, however, the added value of the specific reductions for treewidth four fades away with the width. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Hein, A., & Koster, A. M. C. A. (2011). An experimental evaluation of treewidth at most four reductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6630 LNCS, pp. 218–229). https://doi.org/10.1007/978-3-642-20662-7_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
