Levin, A. and Paulusma, Daniel and Woeginger, G.J. (2008) 'The computational complexity of graph contractions II : two tough polynomially solvable cases.', Networks., 52 (1). pp. 32-56.
For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H. This article is part II of our study on the computational complexity of the H-CONTRACTIBILITY problem. In the first article we pinpointed the complexity for all pattern graphs with five vertices except for two pattern graphs H. Here, we present polynomial time algorithms for these two remaining pattern graphs. 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.
|Keywords:||Graph, Edge contraction, Dominating vertex, Wheel, Computational complexity.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1002/net.20249|
|Date accepted:||No date available|
|Date deposited:||No date available|
|Date of first online publication:||August 2008|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|