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

TCS

2010

2010

: We study a variant of the path cover problem, namely, the k-ﬁxed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-ﬁxed-endpoint path cover of G with respect to T is a set of vertex-disjoint paths P that covers the vertices of G such that the k vertices of T are all endpoints of the paths in P. The kPC problem is to ﬁnd a k-ﬁxed-endpoint path cover of G of minimum cardinality; note that, if T is empty (or, equivalently, k = 0), the stated problem coincides with the classical path cover problem. The kPC problem generalizes some path cover related problems, such as the 1HP and 2HP problems, which have been proved to be NP-complete. Note that, the complexity status of both 1HP and 2HP problems on interval graphs remains an open question [9]. In this paper, we show that the kPC problem can be solved in linear time on the class of proper interval graphs, that is, in O(n + m) time on a proper interval graph on n vertices and m...

Related Content

Added |
30 Jan 2011 |

Updated |
30 Jan 2011 |

Type |
Journal |

Year |
2010 |

Where |
TCS |

Authors |
Katerina Asdre, Stavros D. Nikolopoulos |

Comments (0)