An experimental evaluation of treewidth at most four reductions

Authors:
Alexander Hein;Arie M. C. A. Koster
Affiliations:
Student of Mathematics, RWTH Aachen University, Aachen, Germany;Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 7
Cited 1

Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Linear algorithms for graphs of tree-width at most four

Linear algorithms for graphs of tree-width at most four
On Linear Recognition of Tree-Width at Most Four

SIAM Journal on Discrete Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Safe Reduction Rules for Weighted Treewidth

Algorithmica
Treewidth computations I. Upper bounds

Information and Computation

Fixed-Parameter tractability of treewidth and pathwidth

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

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.