Login / Signup

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.

Fedor V. FominMathieu LiedloffPedro MontealegreIoan Todinca
Published in: Algorithmica (2018)
Keyphrases
  • vertex cover
  • maximal cliques
  • graph theory
  • approximation algorithms
  • maximal clique enumeration
  • learning algorithm
  • error bounds
  • maximum clique