scientific article
From MaRDI portal
Publication:2911626
DOI10.4230/LIPIcs.FSTTCS.2011.217zbMath1246.68132MaRDI QIDQ2911626
Pim van 't Hof, Pinar Heggernes, Daniel Lokshtanov, Christophe Paul
Publication date: 31 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Increasing the Minimum Degree of a Graph by Contractions ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Increasing the minimum degree of a graph by contractions ⋮ Combing a Linkage in an Annulus ⋮ Obtaining split graphs by edge contraction ⋮ Contracting graphs to paths and trees ⋮ A faster FPT algorithm for bipartite contraction ⋮ A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem ⋮ Important Separators and Parameterized Algorithms ⋮ On the Parameterized Complexity of Contraction to Generalization of Trees.
This page was built for publication:
