H20Zhang / Crystal

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".
11Updated 6 years ago

Alternatives and similar repositories for Crystal:

Users that are interested in Crystal are comparing it to the libraries listed below