Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs.

Matthew Johnson Giacomo Paesani Daniël Paulusma

Published in: WG (2018)

Keyphrases

vertex cover
planar graphs
approximation algorithms
partial order
graph theory
weighted graph
undirected graph
precedence constraints
dynamic programming
worst case
bipartite graph
optimality criterion