Weighted k-path Vertex Cover Problem in Cactus Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 103 === A subset S of vertices in graph G is a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is called the k-path vertex cover number of a graph G. In this thesis, we consider the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/74897149092914985575 |
| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 103 === A subset S of vertices in graph G is a k-path vertex cover if every path of order
k in G contains at least one vertex from S. The cardinality of a minimum k-path
vertex cover is called the k-path vertex cover number of a graph G. In this thesis, we consider the weighted version of a k-path vertex cover problem, in which vertices are given weights, and propose an O(n3) algorithm for solving this problem in cactus graphs.
|
|---|