Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems.

François Delbot Christian Laforest Stephane Rovedakis

Published in: OPODIS (2014)

Keyphrases

vertex cover
approximation algorithms
optimization problems
maximum clique
learning algorithm
problems in computer vision
worst case
planar graphs
computational complexity
np hard
graph cuts
theoretical analysis