This repository contains the source code for our paper: Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs.
- cmake (>3.15)
- g++ (supports c++17)
- GNU Make
All the networks can be downloaded from KONECT.
- Download datasets.
- Compile project with
make build
andcd bin
. - Reformat datasets with
./reformat <data_path>
, where<data_path>
is the path for input dataset, e.g.,./reformat ../data/WQ
. - Run the specific algorithm with
./main <argv[1]> <argv[2]> <argv[3]> <...>
, such as./main ../data/WQ 3456000 3
. The specific parameters are as follows. Note that theoutput
folder needs to be created in advance to save the instances.
argv[1] = data_path
argv[2] = delta
argv[3] = algorithm :
-10 : TBE (not print instance, for experiments)
-11 : TBE (print instance)
-20 : TBE$^+$ (not print instance, for experiments)
-21 : TBE$^+$ (print instance)
1 : TBC
2 : TBC$^+$
3 : TBC$^{++}$
4 : STBC
5 : STBC$^+$
(optional)
argv[4] = |Window| for algorithm 4,5 (default: 10000)
argv[5] = |Stride|/|window| for algorithm 4,5 (default: 0.05)
argv[6] = |Thread| for algorithm 5 (default: 8)