Deconstructing parameterized hardness of Fair Vertex Deletion problems

DOI10.1007/978-3-030-26176-4_27OpenAlexW2964090009MaRDI QIDQ2300050

Venkatesh Raman, Vibha Sahlot, Ashwin Jacob

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_27

zbMATH Keywords

parameterized complexityW-hardnesskernelizationVertex Deletion problems

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ Parameterized complexity of fair feedback vertex set problem ⋮ Local linear set on graphs with bounded twin cover number

This page was built for publication: Deconstructing parameterized hardness of Fair Vertex Deletion problems