Login / Signup

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs.

George Manoussakis
Published in: IPEC (2017)
Keyphrases
  • np hard
  • search space
  • probabilistic model
  • optimal solution
  • matching algorithm
  • high dimensional
  • evolutionary algorithm
  • simulated annealing
  • graph theory
  • weighted graph
  • maximal clique enumeration