ehab-abdelhamid / GraMi
GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph …
☆111Updated last year
Alternatives and similar repositories for GraMi:
Users that are interested in GraMi are comparing it to the libraries listed below
- Parallel Frequent Subgraph Mining☆29Updated 7 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆199Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆150Updated last year
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆13Updated 4 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 6 months ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- ☆26Updated 2 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 4 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆53Updated 3 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆29Updated 9 years ago
- A general-purpose, distributed graph random walk engine.☆111Updated last year
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 9 years ago
- ☆13Updated 3 years ago
- VF2 - Subgraph Isomorphism☆45Updated 4 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆80Updated 7 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 6 years ago
- Graph Pattern Mining☆88Updated 4 months ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆120Updated 2 years ago
- A collection of awesome papers about graph processing.☆15Updated 5 years ago
- ☆14Updated 5 months ago
- Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…☆26Updated 3 years ago
- Out-of-core graph processing on a single machine.☆128Updated 6 years ago
- ☆16Updated 4 years ago
- Codes for TopPPR☆13Updated 5 years ago
- Ullman Algorithm - An Algorithm for Subgraph Isomorphism☆27Updated last year