A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Scalable subgraph counting using MapReduce
2017
Proceedings of the Symposium on Applied Computing - SAC '17
Networks are powerful in representing a wide variety of systems in many fields of study. Networks are composed of smaller substructures (subgraphs) that characterize them and give important information related to their topology and functionality. Therefore, discovering and counting these subgraph patterns is very important towards mining the features of networks. Algorithmically, subgraph counting in a network is a computationally hard problem and the needed execution time grows exponentially
doi:10.1145/3019612.3019744
dblp:conf/sac/EddinR17
fatcat:w4cy2p6abnc57o4iuenmawvwo4