On the k-path vertex cover of some graph products.
Marko JakovacAndrej TaranenkoPublished in: Discret. Math. (2013)
Keyphrases
- vertex cover
- planar graphs
- approximation algorithms
- graph theory
- precedence constraints
- shortest path
- undirected graph
- partial order
- directed acyclic graph
- minimum cost
- random walk
- spanning tree
- directed graph
- minimum spanning tree
- reinforcement learning
- bipartite graph
- constant factor
- np hard
- optimality criterion
- special case