Login / Signup
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.
Fedor V. Fomin
Mathieu Liedloff
Pedro Montealegre-Barba
Ioan Todinca
Published in:
SWAT (2014)
Keyphrases
</>
vertex cover
maximal cliques
graph theory
maximal clique enumeration
computational complexity
approximation algorithms
maximum clique
optimization problems
learning algorithm
worst case
error bounds