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:

Partitioning graphs into connected parts.

Hof, P. van 't and Paulusma, Daniel and Woeginger, G. J. (2009) 'Partitioning graphs into connected parts.', in Computer science - theory and applications. Heidelberg: Springer, pp. 143-154. Lecture notes in computer science. (5675).


The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The Longest Path Contractibility problem asks for the largest integer ℓ for which an input graph can be contracted to the path P ℓ on ℓ vertices. We show that the computational complexity of the Longest Path Contractibility problem restricted to P ℓ-free graphs jumps from being polynomially solvable to being NP-hard at ℓ= 6, while this jump occurs at ℓ= 5 for the 2-Disjoint Connected Subgraphs problem. We also present an exact algorithm that solves the 2-Disjoint Connected Subgraphs problem faster than for any n-vertex P ℓ-free graph. For ℓ= 6, its running time is . We modify this algorithm to solve the Longest Path Contractibility problem for P 6-free graphs in time.

Item Type:Book chapter
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:August 2009
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar