Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width.

Martin Doucha Jan Kratochvíl

Published in: MFCS (2012)

Keyphrases

vertex cover
approximation algorithms
maximum clique
partial order
clustering algorithm
planar graphs
precedence constraints
optimality criterion
np hard
upper bound
worst case
belief propagation
directed graph
undirected graph