Quadratic vertex kernel for split vertex deletion

DOI10.1007/978-3-030-17402-6_1zbMath1489.68179OpenAlexW2945416986MaRDI QIDQ5919394

Akanksha Agrawal, Sushmita Gupta, R. Krithika, Pallavi Jain

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_1

zbMATH Keywords

parameterized complexitykernelizationsplit vertex deletionkernel lower bound

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Quadratic vertex kernel for split vertex deletion