❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop
-
Updated
Jul 1, 2022 - Java
❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop
Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders of magnitude on very large graphs. The work was published on VLDB 2018 with title "Subgraph matching: on compression and computation".
Directed Multigraph Miner (DMGM)
Implementation of Subgraph isomorphism algorithm and optimization techniques on neo4j graph database
subgraph isomorphism based on CPI
Distributed Subgraph Enumeration via Backtracking-based Framework
Add a description, image, and links to the subgraph-isomorphism topic page so that developers can more easily learn about it.
To associate your repository with the subgraph-isomorphism topic, visit your repo's landing page and select "manage topics."