0

I have graph G(V,E) with E=120 and G=5340. I want to enumerate and extract all maximal cliques by using the Bron-Kerbosch clique detection algorithm, but when I run the program in Eclipse, it fails with this message:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
    at java.util.HashMap.newNode(Unknown Source)

How can I determine how many cliques there are in a simple graph?

John Bollinger
  • 160,171
  • 8
  • 81
  • 157
M.amani
  • 1
  • 2

1 Answers1

0

As others suggested you need to increase your heap size or try another alternative, for example: you can reduce clique problem to SAT problem, and solve it by using any MiniSAT online solver