Login / Signup
The k-path vertex cover of rooted product graphs.
Marko Jakovac
Published in:
Discret. Appl. Math. (2015)
Keyphrases
</>
vertex cover
planar graphs
approximation algorithms
partial order
shortest path
weighted graph
undirected graph
polynomial time approximation
directed graph
minimum cost
precedence constraints
single machine scheduling problem
optimality criterion