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.
This work is supported by EPSRC (EP/G043434/1).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amini, O., Sau, I., Saurabh, S.: Parameterized complexity of finding small degree-constrained subgraphs. Journal of Discrete Algorithms (to appear)
Asano, T., Hirata, T.: Edge-contraction problems. J. Comput. Syst. Sci. 26, 197–208 (1983)
Belmonte, R., Heggernes, P., van ’t Hof, P.: Edge Contractions in Subclasses of Chordal Graphs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 528–539. Springer, Heidelberg (2011)
Belmonte, R., Golovach, P.A., Heggernes, P., van ’t Hof, P., Kamiński, M., Paulusma, D.: Finding contractions and induced minors in chordal graphs via disjoint paths. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011). LNCS, Springer, Heidelberg (to appear, 2011)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bodlaender, H.L., Wolle, T., Koster, A.M.C.A.: Contraction and treewidth lower bounds. J. Graph Algorithms Appl. 10, 5–49 (2006)
Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. Journal of Graph Theory 11, 71–79 (1987)
Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput. 85(1), 12–75 (1990)
Diestel, R.: Graph Theory, Electronic edn. Springer, Heidelberg (2005)
Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53–61 (2009)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
Hammack, R.: A note on the complexity of computing cyclicity. Ars Comb. 63, 89–95 (2002)
Heggernes, P., van ’t Hof, P., Lévěque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. In: Proceedings of LAGOS 2011. Electronic Notes in Discrete Mathematics, vol. 37, pp. 87–92 (2011)
Heggernes, P., van ’t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges, ArXiv:1102.5441 (manuscript)
Heggernes, P., van ’t Hof, P., Lévěque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees, ArXiv:1104.3677 (manuscript)
van ’t Hof, P., Kamiński, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Appl. Math. (to appear)
van ’t Hof, P., Paulusma, D., Woeginger, G.J.: Partitioning graphs into connected parts. Theoretical Computer Science 410, 4834–4843 (2009)
Kamiński, M., Paulusma, D., Thilikos, D.M.: Contractions of Planar Graphs in Polynomial Time. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 122–133. Springer, Heidelberg (2010)
Martin, B., Paulusma, D.: The Computational Complexity of Disconnected Cut and 2K2-Partition. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 561–575. Springer, Heidelberg (2011)
Levin, A., Paulusma, D., Woeginger, G.J.: The computational complexity of graph contractions I: polynomially solvable and NP-complete cases. Networks 51, 178–189 (2008)
Levin, A., Paulusma, D., Woeginger, G.J.: The computational complexity of graph contractions II: two tough polynomially solvable cases. Networks 52, 32–56 (2008)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
Watanabe, T., Ae, T., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or edge-contraction. Discrete Appl. Math. 3, 151–153 (1981)
Watanabe, T., Ae, T., Nakamura, A.: On the NP-hardness of edge-deletion and edge-contraction problems. Discrete Appl. Math. 6, 63–78 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golovach, P.A., Kamiński, M., Paulusma, D., Thilikos, D.M. (2012). Increasing the Minimum Degree of a Graph by Contractions. In: Marx, D., Rossmanith, P. (eds) Parameterized and Exact Computation. IPEC 2011. Lecture Notes in Computer Science, vol 7112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28050-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-28050-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28049-8
Online ISBN: 978-3-642-28050-4
eBook Packages: Computer ScienceComputer Science (R0)