On Complexity of Total Vertex Cover on Subcubic Graphs.

Sheung-Hung Poon Wei-Lin Wang

Published in: TAMC (2017)

Keyphrases

vertex cover
planar graphs
approximation algorithms
worst case
computational complexity
partial order
weighted graph
np hard
precedence constraints
optimality criterion