spcl / gmsLinks
GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
☆25Updated 4 years ago
Alternatives and similar repositories for gms
Users that are interested in gms are comparing it to the libraries listed below
Sorting:
- Dynamic data structure for sparse graphs.☆31Updated last year
- A Framework for Graph Sampling and Random Walk on GPUs.☆38Updated 8 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…☆27Updated 4 years ago
- Graph Pattern Mining☆91Updated last year
- Multi-threaded Large-Scale RMAT Graph Generator.☆130Updated 2 years ago
- ☆17Updated 5 years ago
- ☆39Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Updated 6 years ago
- ☆31Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆58Updated 2 years ago
- ☆40Updated 4 years ago
- ☆12Updated last year
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- ☆47Updated 3 years ago
- FlashMob is a shared-memory random walk system.☆32Updated 2 years ago
- ☆28Updated last year
- Graph Sampling using GPU☆52Updated 3 years ago
- ☆25Updated 2 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆51Updated 2 years ago
- ☆19Updated 5 years ago
- ☆17Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- Graph edge partitioning algorithms☆47Updated 6 years ago
- ☆25Updated 10 months ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated 3 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆35Updated 2 months ago
- ☆13Updated last year
- ☆47Updated 6 months ago