Login / Signup

Toward an efficient, highly scalable maximum clique solver for massive graphs.

Ronald D. HaganCharles A. PhillipsKai WangGary L. RogersMichael A. Langston
Published in: IEEE BigData (2014)
Keyphrases
  • highly scalable
  • maximum clique
  • massive graphs
  • branch and bound algorithm
  • association graph
  • database
  • information retrieval
  • data points
  • language model
  • maximal cliques
  • reachability queries