The complexity of regular subgraph recognition
Discrete Applied Mathematics - Computational combinatiorics
Deciding whether a planar graph has a cubic subgraph is NP-complete
Discrete Mathematics
Finding regular subgraphs in both arbitrary and planar graphs
Discrete Applied Mathematics
On locating cubic subgraphs in bounded-degree connected bipartite graphs
Discrete Mathematics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
On the fixed-parameter tractability of parameterized model-checking problems
Information Processing Letters
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Clustering with local restrictions
Information and Computation
Hi-index | 0.00 |
We study variants and generalizations of the problem of finding an r-regular subgraph (where r ≤ 3) in a given graph by deleting at most k vertices. Moser and Thilikos (2006) have shown that the problem is fixed-parameter tractable (FPT) if parameterized by (k, r). They asked whether the problem remains fixed-parameter tractable if parameterized by k alone. We answer this question negatively: we show that if parameterized by k alone the problem is W[1]-hard and therefore very unlikely fixed-parameter tractable. We also give W[1]-hardness results for variants of the problem where the parameter is the number of vertex and edge deletions allowed, and for a new generalized form of the problem where the obtained subgraph is not necessarily regular but its vertices have certain prescribed degrees. Following this we demonstrate fixed-parameter tractability for the considered problems if the parameter includes the regularity r or an upper bound on the prescribed degrees in the generalized form of the problem. These FPT results are obtained via kernelization, so also provide a practical approach to the problems presented.