Login / Signup

Efficiently enumerating all maximal cliques with bit-parallelism.

Pablo San SegundoJorge ArtiedaDarren Strash
Published in: Comput. Oper. Res. (2018)
Keyphrases
  • maximal cliques
  • graph theory
  • graph theoretic
  • neural network
  • genetic algorithm
  • social networks
  • higher order
  • fully connected
  • maximal clique enumeration