Parameterized Complexity of Vertex Deletion into Perfect Graph Classes

DOI10.1007/978-3-642-22953-4_21zbMath1342.68165MaRDI QIDQ3088287

Pinar Heggernes, Stefan Kratsch, Yngve Villanger, Bart M. P. Jansen, Pim van 't Hof

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_21

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C75: Structural characterization of families of graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)