ehab-abdelhamid / GraMiLinks
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 …
☆118Updated 2 years ago
Alternatives and similar repositories for GraMi
Users that are interested in GraMi are comparing it to the libraries listed below
Sorting:
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Updated 2 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆213Updated 5 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- Parallel Frequent Subgraph Mining☆30Updated 8 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 4 years ago
- ☆27Updated 3 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆60Updated 4 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆135Updated 4 months ago
- Graph Partitoning Using Graph Convolutional Networks☆67Updated 3 years ago
- Out-of-core graph processing on a single machine.☆130Updated 7 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated last year
- A collection of awesome papers about graph processing.☆15Updated 6 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- VF2 - Subgraph Isomorphism☆48Updated 4 months ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆144Updated 2 years ago
- ☆28Updated last year
- Codes for TopPPR☆14Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆51Updated 2 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 8 months ago
- ☆14Updated 4 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 10 years ago
- ☆19Updated 4 years ago
- a k-cliques algorithm☆19Updated 4 years ago