Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Increasing the minimum degree of a graph by contractions.

Golovach , P.A. and Kaminski, M. and Paulusma, Daniel and Thilikos, D.M. (2013) 'Increasing the minimum degree of a graph by contractions.', Theoretical computer science., 481 . pp. 74-84.

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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
(401Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/j.tcs.2013.02.030
Publisher 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
Date accepted:No date available
Date deposited:19 April 2013
Date of first online publication:April 2013
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar