Efficient algorithm for the vertex cover Pk problem on cacti

Jianhua Tu

Applied Mathematics and Computation, 2017, vol. 311, issue C, 217-222

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: Efficient algorithm; Vertex cover Pk problem; Cactus graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317303351
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:311:y:2017:i:c:p:217-222

DOI: 10.1016/j.amc.2017.05.034

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().