IMPORTANT: this software is superseded by the (much faster) C++ graphlet mining tool MOTIVO available at https://gitlab.com/steven3k/motivo.
This is the CC algorithm for counting graphlets (i.e. induced subgraphs, also called motifs or patterns) in large graphs. It is ready-to-use for graphs in the WebGraph format (http://webgraph.di.unimi.it/). If you publish results based on this code, please acknowledge us by citing these two papers:
@inproceedings{BCKLP2017,
author = {Bressan, Marco and Chierichetti, Flavio and Kumar, Ravi and Leucci, Stefano and Panconesi, Alessandro},
title = {Counting Graphlets: Space vs Time},
booktitle = {Proceedings of the Tenth ACM International Conference on Web Search and Data Mining},
series = {WSDM '17},
year = {2017},
isbn = {978-1-4503-4675-7},
location = {Cambridge, United Kingdom},
pages = {557--566},
numpages = {10},
url = {http://doi.acm.org/10.1145/3018661.3018732},
doi = {10.1145/3018661.3018732},
acmid = {3018732},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {color coding, graph mining, graphlet counting,
random walk, subgraph enumeration, subgraph sampling}
}
and
@article{BCKLP2018,
author = {Bressan, Marco and Chierichetti, Flavio and Kumar, Ravi and Leucci, Stefano and Panconesi, Alessandro},
title = {Motif Counting Beyond Five Nodes},
journal = {ACM Trans. Knowl. Discov. Data},
issue_date = {July 2018},
volume = {12},
number = {4},
month = apr,
year = {2018},
issn = {1556-4681},
pages = {48:1--48:25},
articleno = {48},
numpages = {25},
url = {http://doi.acm.org/10.1145/3186586},
doi = {10.1145/3186586},
acmid = {3186586},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Motif counting, color coding, graph mining, subgraph counting}
}