Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems

DOI10.1007/978-3-319-26626-8_31zbMath1473.68095arXiv1507.06341MaRDI QIDQ3467861

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

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

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

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.)

68Q27: Parameterized complexity, tractability and kernelization