Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems

DOI10.1007/978-3-662-49529-2_7zbMath1415.68155arXiv1509.08807MaRDI QIDQ2802929

Naveen Sivadasan, N. R. Aravind, R. B. Sandeep

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.08807

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

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