Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover.

Peter Damaschke Leonid Molokov

Published in: Theor. Comput. Sci. (2012)

Keyphrases

vertex cover
graph theory
planar graphs
learning algorithm
theoretical analysis
approximation algorithms
random walk
computational complexity
connected components