On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
From MaRDI portal
Publication:2867087
DOI10.1007/978-3-319-03898-8_21zbMath1406.68034MaRDI QIDQ2867087
Saket Saurabh, Daniel Lokshtanov, Neeldhara Misra
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_21
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
