Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
From MaRDI portal
Publication:2867069
DOI10.1007/978-3-319-03898-8_3zbMath1360.68488OpenAlexW194907680MaRDI QIDQ2867069
Rémy Belmonte, Daniël Paulusma, Petr A. Golovach, Pim van 't Hof
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/14198/1/14198.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Obtaining split graphs by edge contraction ⋮ Parameterized complexity of three edge contraction problems with degree constraints ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
This page was built for publication: Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
