Parameterized complexity of vertex deletion into perfect graph classes

DOI10.1016/j.tcs.2012.03.013zbMath1407.68223MaRDI QIDQ392038

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

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.013

zbMATH Keywords

perfect graphs; parameterized complexity; kernelization; vertex deletion problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C17: Perfect graphs