CREST

Supplementary materials for CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space

Dependencies

• g++ compiler with C++17 support

Build

cd code; make clean; make

Usage

Approximate $k$-clique counting on Stanford dataset for $k=12$ with $\varepsilon = 0.001$ relative error tolerance and $\delta = 0.01$ failure probability.

./CREST --input=../dataset/Stanford.txt --k=12 --epsilon=0.001 --delta=0.01

Input format

The first line contains the number of vertices $n$ and the number of edges $m$. Each of the next $m$ lines contains an edge.

4 5
0 1
0 2
1 2
1 3
2 3