spcl / gmsLinks
GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
☆26Updated 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 10 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
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Graph Pattern Mining☆93Updated last year
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆39Updated 6 years ago
- ☆28Updated last year
- ☆12Updated last year
- Multi-threaded Large-Scale RMAT Graph Generator.☆132Updated 2 years ago
- ☆31Updated 5 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- ☆17Updated 3 years ago
- ☆42Updated 4 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆58Updated 3 years ago
- ☆25Updated 3 weeks ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- ☆17Updated 5 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆51Updated 3 years ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆36Updated 3 years ago
- FlashMob is a shared-memory random walk system.☆32Updated 2 years ago
- ☆26Updated 3 years ago
- Papers on Graph Analytics, Mining, and Learning☆127Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 4 months ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- ☆47Updated 3 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆36Updated 4 months ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆14Updated 4 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago