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:
CoRR (2014)
Keyphrases
</>
vertex cover
maximal cliques
maximal clique enumeration
maximum clique
optimization problems
approximation algorithms
graph theory
markov random field
partial order