Contraction Bidimensionality: The Accurate Picture

We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we unify and significantly simplify contraction bidimensionality theory—the meta algorithmic framework to design efficient parameterized and approximation algorithms for contraction closed parameters.

• Type: Conference
• Year: 2009
• Where: ESA
• Authors: Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
• Keywords: Algorithms, Contraction Bidimensionality, Contraction Closed Parameters, ESA 2009, Meta Algorithmic Framework