2010/01/01 by Fedor V. Fomin, Fomin, Fedor V., Petr A. Golovach +3
Computer Science · Engineering · #Advanced Graph Theory Research #Bidimensionality #Complexity and Algorithms in Graphs #Control and Stability of Dynamical Systems #Graph Minors #Paramerterized Algorithms
paper · doi:10.4230/dagsemproc.09511.5
openalex publication_date 2010/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.