Depth-First Search and the Vertex Cover Problem.

Carla D. Savage

Published in: Inf. Process. Lett. (1982)

Keyphrases

vertex cover
depth first search
approximation algorithms
breadth first search
search tree
planar graphs
precedence constraints
partial order
routing problem
branch and bound algorithm
branch and bound
optimality criterion
spanning tree
tree search
special case
minimum cost
np hard