The k-path vertex cover: General bounds and chordal graphs.

Csilla Bujtás Marko Jakovac Zsolt Tuza

Published in: Networks (2022)

Keyphrases

vertex cover
special case
approximation algorithms
planar graphs
undirected graph
shortest path
lower bound
probabilistic model
upper bound
objective function
random walk
combinatorial optimization
directed graph
graph theory
lower and upper bounds