Login / Signup

A generalization of a Turán's theorem about maximum clique on graphs.

Douglas Frederico Guimarães SantiagoAnderson Luiz Pedrosa PortoKaio Ariel Silva Sá
Published in: Electron. J. Graph Theory Appl. (2022)
Keyphrases
  • maximum clique
  • association graph
  • branch and bound algorithm
  • maximal cliques
  • computational biology
  • graph theory
  • lower bound
  • machine learning
  • optimal solution
  • upper bound
  • vertex cover
  • maximal clique enumeration