Skip to main content

Research Repository

Advanced Search

Increasing the minimum degree of a graph by contractions

Golovach, P.A.; Kaminski, M.; Paulusma, D.; Thilikos, D.M.

Increasing the minimum degree of a graph by contractions Thumbnail


Authors

P.A. Golovach

M. Kaminski

D.M. Thilikos



Abstract

The Degree Contractibility problem is to test whether a given graph G can be modified to a graph of minimum degree at least d by using at most k contractions. We prove the following three results. First, Degree Contractibility is NP-complete even when d=14. Second, it is fixed-parameter tractable when parameterized by k and d. Third, it is -hard when parameterized by k. We also study its variant where the input graph is weighted, i.e., has some edge weighting and the contractions preserve these weights. The Weighted Degree Contractibility problem is to test if a weighted graph G can be contracted to a weighted graph of minimum weighted degree at least d by using at most k weighted contractions. We show that this problem is NP-complete and that it is fixed-parameter tractable when parameterized by k. In addition, we pinpoint a relationship with the problem of finding a minimal edge-cut of maximum size in a graph and study the parameterized complexity of this problem and its variants.

Citation

Golovach, P., Kaminski, M., Paulusma, D., & Thilikos, D. (2013). Increasing the minimum degree of a graph by contractions. Theoretical Computer Science, 481, 74-84. https://doi.org/10.1016/j.tcs.2013.02.030

Journal Article Type Article
Publication Date Apr 1, 2013
Deposit Date Mar 11, 2013
Publicly Available Date Apr 19, 2013
Journal Theoretical Computer Science
Print ISSN 0304-3975
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 481
Pages 74-84
DOI https://doi.org/10.1016/j.tcs.2013.02.030
Public URL https://durham-repository.worktribe.com/output/1465337

Files

Accepted Journal Article (410 Kb)
PDF

Copyright Statement
NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical computer science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical computer science, 481, 2013, 10.1016/j.tcs.2013.02.030





You might also like



Downloadable Citations