Skip to main content

Research Repository

Advanced Search

The computational complexity of graph contractions I: polynomially solvable and NP-complete cases

Levin, A.; Paulusma, D.; Woeginger, G.J.

Authors

A. Levin

G.J. Woeginger



Abstract

For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H. This paper is part I of our study on the computational complexity of the H-CONTRACTIBILITY problem. We continue a line of research that was started in 1987 by Brouwer and Veldman, and we determine the computational complexity of the H-CONTRACTIBILITY problem for certain classes of pattern graphs. In particular, we pinpoint the complexity for all graphs H with five vertices except for two graphs, whose polynomial time algorithms are presented in part II. Interestingly, in all connected cases that are known to be polynomially solvable, the pattern graph H has a dominating vertex, whereas in all cases that are known to be NP-complete, the pattern graph H does not have a dominating vertex.

Citation

Levin, A., Paulusma, D., & Woeginger, G. (2008). The computational complexity of graph contractions I: polynomially solvable and NP-complete cases. Networks, 51(3), 178-189. https://doi.org/10.1002/net.20214

Journal Article Type Article
Publication Date May 1, 2008
Deposit Date Oct 6, 2010
Journal Networks
Print ISSN 0028-3045
Electronic ISSN 1097-0037
Publisher Wiley
Peer Reviewed Peer Reviewed
Volume 51
Issue 3
Pages 178-189
DOI https://doi.org/10.1002/net.20214
Keywords Graph, Edge contraction, Dominating vertex, Computational complexity.
Public URL https://durham-repository.worktribe.com/output/1515676
Publisher URL http://dx/doi.org/10.1002/net.20214


You might also like



Downloadable Citations