Vertex deletion on split graphs: beyond 4-hitting set

DOI10.1007/978-3-030-17402-6_14zbMath1462.68136MaRDI QIDQ5919400

R. Krithika, Vibha Sahlot, Pallavi Jain, Pratibha Choudhary

Publication date: 6 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-17402-6_14

zbMATH Keywords

split graphs; approximation algorithms; parameterized algorithms; kernelization; vertex deletion problems

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

68W25: Approximation algorithms

68Q27: Parameterized complexity, tractability and kernelization