Abstract

This paper introduces the maximum version of the k-path vertex cover problem, called the Maximum k-Path Vertex Cover problem (MaxPkVC for short): A path consisting of k vertices, i.e., a path of length k−1 is called a k-path. If a k-path Pk includes a vertex v in a vertex set
... read more