A Parallel Graphlet Decomposition Library for Large Graphs
-
Updated
Mar 21, 2019 - C++
A Parallel Graphlet Decomposition Library for Large Graphs
❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop
The official implementation of WSDM'24 paper <DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting>
Source code for GraphMini and the two baseline systems (GraphPi and Dryadic) for comparison.
DISC - Distributed Subgraph Counting for Arbitrary Pattern and Orbit
A Linear Delay Linear Space Algorithm for Enumeration of All Connected Induced Subgraphs
Perform statistical analysis of network data based on centred subgraph counts
A Generic Solver for Fixed-Cardinality Subgraph Problems
Add a description, image, and links to the subgraph-count topic page so that developers can more easily learn about it.
To associate your repository with the subgraph-count topic, visit your repo's landing page and select "manage topics."