Increasing the minimum degree of a graph by contractions

  • Authors:

  • Petr A. Golovach;Daniël Paulusma;Dimitrios M. Thilikos

  • Affiliations:

  • School of Engineering and Computing Sciences, Durham University Science Laboratories, Durham, United Kingdom;School of Engineering and Computing Sciences, Durham University Science Laboratories, Durham, United Kingdom;Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece

  • Venue:
  • IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 W[1]-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.