Vertex Cover Gets Faster and Harder on Low Degree Graphs.

Akanksha Agrawal Sathish Govindarajan Neeldhara Misra

Published in: CoRR (2014)

Keyphrases

vertex cover
low degree
planar graphs
approximation algorithms
np hard
partial order
undirected graph
precedence constraints
uniform distribution
decision lists
computational complexity
scheduling problem
np complete
directed graph
minimum spanning tree