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:

The computational complexity of graph contractions II : two tough polynomially solvable cases.

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.

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 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.

Item Type:Article
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
Record Created:06 Oct 2010 14:20
Last Modified:03 Apr 2013 13:17

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library