| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5775731 | Applied Mathematics and Computation | 2017 | 6 Pages |
Abstract
Given a graph G=(V,E), the vertex cover Pk (VCPk) problem is to find a minimum set FâV such that every path of order k in G contains at least one vertex from F. For any integer k ⥠2, the VCPk problem for general graphs is NP-hard. The paper presents an efficient algorithm for the VCPk problem on cacti.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jianhua Tu,