期刊
DISCRETE APPLIED MATHEMATICS
卷 154, 期 1, 页码 76-105出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2005.07.002
关键词
graph algorithms; path cover; Hamiltonian cycle; Hamiltonian path; interval graphs; circular-arc graphs
A path cover of a graph G = (V, E) is a family of vertex-disjoint paths that covers all vertices in V. Given a graph G, the path cover problem is to find a path cover of minimum cardinality. This paper presents a simple O(n)-time approximation algorithm for the path cover problem on circular-arc graphs given a set of n arcs with endpoints sorted. The cardinality of the path cover found by the approximation algorithm is at most one more than the optimal one. By using the result, we reduce the path cover problem on circular-arc graphs to the Hamiltonian cycle and Hamiltonian path problems on the same class of graphs in O(n) time. Hence the complexity of the path cover problem on circular-arc graphs is the same as those of the Hamiltonian cycle and Hamiltonian path problems on circular-arc graphs. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据