FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters

DOI10.1007/978-3-319-59605-1_19zbMath1489.68197MaRDI QIDQ4632216

Venkatesh Raman, Diptapriyo Majumdar

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_19

zbMATH Keywords

split graph; polynomial time; vertex cover; cluster graph; reduction rule

Mathematics Subject Classification ID

68W40: Analysis of algorithms

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

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68Q27: Parameterized complexity, tractability and kernelization