\textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
From MaRDI portal
Publication:1941715
DOI10.1016/j.ipl.2013.01.001zbMath1259.68256OpenAlexW2053445839MaRDI QIDQ1941715
Publication date: 21 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.001
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (14)
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} ⋮ Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes ⋮ FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters ⋮ Quadratic vertex kernel for split vertex deletion ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models ⋮ Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization ⋮ Conflict free version of covering problems on graphs: classical and parameterized ⋮ Vertex deletion problems on chordal graphs ⋮ Walking through waypoints ⋮ Vertex deletion on split graphs: beyond 4-hitting set ⋮ Revisiting connected vertex cover: FPT algorithms and lossy kernels ⋮ Communication Complexity of Pairs of Graph Families with Applications ⋮ Vertex Deletion Problems on Chordal Graphs ⋮ Faster parameterized algorithms for deletion to split graphs
This page was built for publication: \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
