This implementation is based on D. Strash's work.
The algorithm is discussed in our paper "Fast Maximal Clique Enumeration for Real-world Graphs".
You could run make
in algo_imph directory first to build the program,
then the program is in bin
directory and you can call it with parameters
For example:
$ cd algo_imph
$ make
$ cd bin
$ nqc --input-file=[your data file] --algorithm=newhybrid
There are three MCE approaches in our implementation. Everyone could try them by using --algorithm=[newhybrid|naive|degeneracy]
The format of our codes is similar to edgelist format, but it has the total number of vertices in the first line.
For example:
nodenum
v0 v1
v1 v2
...
vi vj
For any questions, please contact [email protected] or [email protected] .