Parameterized complexity of fair deletion problems

DOI10.1016/j.dam.2019.06.001zbMath1437.05227arXiv1605.07959MaRDI QIDQ2174554

Tomáš Masařík, Tomáš Toufar

Publication date: 21 April 2020

Published in: Discrete Applied Mathematics, Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

vertex cover; parameterized complexity; tree-depth; neighborhood diversity; metatheorems; fair problems

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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

05C99: Graph theory

68Q27: Parameterized complexity, tractability and kernelization