Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems.

François Delbot Christian Laforest Stephane Rovedakis

Published in: CoRR (2014)

Keyphrases

vertex cover
approximation algorithms
optimization problems
planar graphs
maximum clique
computational complexity
combinatorial optimization
problems in computer vision
np hard
worst case
graph theory
optimality criterion
objective function
upper bound
maximum likelihood
precedence constraints