Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
A unified approximation algorithm for node-deletion problems
Discrete Applied Mathematics
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Discrete Applied Mathematics
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Chordal Deletion is Fixed-Parameter Tractable
Algorithmica
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Obtaining a Planar Graph by Vertex Deletion
Algorithmica
Parameterized Complexity
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
Information Processing Letters
Hi-index | 0.00 |
An undirected graph is said to be split if its vertex set can be partitioned into two sets such that the subgraph induced on one of them is a complete graph and the subgraph induced on the other is an independent set. We study the problem of deleting the minimum number of vertices or edges from a given input graph so that the resulting graph is split.We initiate a systematic study and give efficient fixed-parameter algorithms and polynomial sized kernels for the problem. More precisely, 1 for Split Vertex Deletion, the problem of determining whether there are k vertices whose deletion results in a split graph, we give an ${\cal O}^*(2^k)$ algorithm improving on the previous best bound of ${\cal O}^*({2.32^k})$. We also give an ${\cal O}(k^3)$-sized kernel for the problem. 2 For Split Edge Deletion, the problem of determining whether there are k edges whose deletion results in a split graph, we give an ${\cal O}^*( 2^{ O(\sqrt{k}\log k) })$ algorithm. We also prove the existence of an ${\cal O}(k^2)$ kernel. In addition, we note that our algorithm for Split Edge Deletion adds to the small number of subexponential parameterized algorithms not obtained through bidimensionality, and on general graphs.