Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CSR

2009

Springer

2009

Springer

The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespeciﬁed 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 2Disjoint Connected Subgraphs problem. We also present an exact algorithm that solves the 2-Disjoint Connected Subgraphs problem faster than O∗ (2n ) for any n-vertex P -free graph. For = 6, its running time is O∗

Related Content

Added |
26 May 2010 |

Updated |
26 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
CSR |

Authors |
Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger |

Comments (0)