Contraction Bidimensionality: The Accurate Picture
From MaRDI portal
Publication:3639283
DOI10.1007/978-3-642-04128-0_63zbMath1256.05202WikidataQ60488676 ScholiaQ60488676MaRDI QIDQ3639283
Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2500/
68W05: Nonnumerical algorithms
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, A Retrospective on (Meta) Kernelization, Contraction-Bidimensionality of Geometric Intersection Graphs, Planar disjoint-paths completion, On graph contractions and induced minors, Confronting intractability via parameters, Spanners in sparse graphs, Contraction bidimensionality of geometric intersection graphs, Induced minor free graphs: isomorphism and clique-width, Subexponential algorithms for partial cover problems, Harmless sets in sparse classes, Contraction obstructions for treewidth, 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs