A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complex Network Analysis Using Parallel Approximate Motif Counting
2014
2014 IEEE 28th International Parallel and Distributed Processing Symposium
Subgraph counting forms the basis of many complex network analysis metrics, including motif and anti-motif finding, relative graphlet frequency distance, and graphlet degree distribution agreements. Determining exact subgraph counts is computationally very expensive. In recent work, we present FASCIA, a shared-memory parallel algorithm and implementation for approximate subgraph counting. FASCIA uses a dynamic programming-based approach and is significantly faster than exhaustive enumeration,
doi:10.1109/ipdps.2014.50
dblp:conf/ipps/SlotaM14
fatcat:uynrdx33p5dtxktuzaypdizphq