R. Belmonte
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
Belmonte, R.; Golovach, P.A.; Hof, van 't P.; Paulusma, D.
Authors
Abstract
Motivated by recent results of Mathieson and Szeider (J. Comput. Syst. Sci. 78(1): 179–191, 2012), we study two graph modification problems where the goal is to obtain a graph whose vertices satisfy certain degree constraints. The Regular Contraction problem takes as input a graph G and two integers d and k, and the task is to decide whether G can be modified into a d-regular graph using at most k edge contractions. The Bounded Degree Contraction problem is defined similarly, but here the objective is to modify G into a graph with maximum degree at most d. We observe that both problems are fixed-parameter tractable when parameterized jointly by k and d. We show that when only k is chosen as the parameter, Regular Contraction becomes W[1]-hard, while Bounded Degree Contraction becomes W[2]-hard even when restricted to split graphs. We also prove both problems to be NP-complete for any fixed d ≥ 2. On the positive side, we show that the problem of deciding whether a graph can be modified into a cycle using at most k edge contractions, which is equivalent to Regular Contraction when d = 2, admits an O(k) vertex kernel. This complements recent results stating that the same holds when the target is a path, but that the problem admits no polynomial kernel when the target is a tree, unless NP ⊆ coNP/poly (Heggernes et al., IPEC 2011).
Citation
Belmonte, R., Golovach, P., Hof, V. '. P., & Paulusma, D. (2013, December). Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. Presented at 8th International Symposium, IPEC 2013, Sophia Antipolis, France
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 8th International Symposium, IPEC 2013 |
Publication Date | Jan 1, 2013 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Jan 15, 2015 |
Print ISSN | 0302-9743 |
Pages | 16-27 |
Series Title | Lecture notes in computer science |
Series Number | 8246 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | 8th International Symposium, IPEC 2013, 4-6 September 2013, Sophia Antipolis, France ; revised selected papers. |
DOI | https://doi.org/10.1007/978-3-319-03898-8_3 |
Public URL | https://durham-repository.worktribe.com/output/1153201 |
Files
Accepted Conference Proceeding
(302 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-03898-8_3
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search