RapidsAtHKUST / ppSCANLinks
ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo
☆32Updated 5 years ago
Alternatives and similar repositories for ppSCAN
Users that are interested in ppSCAN are comparing it to the libraries listed below
Sorting:
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Updated 2 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
- ☆12Updated 8 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- ☆26Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 4 years ago
- Graph edge partitioning algorithms☆48Updated 6 years ago
- A Framework for Graph Sampling and Random Walk on GPUs.☆38Updated 11 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Updated 3 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆214Updated 5 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated last year
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆215Updated 3 weeks ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 4 years ago
- The official SALIENT system described in the paper "Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and P…☆40Updated 2 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆144Updated 2 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Updated 6 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆119Updated 2 years ago
- Automatically exported from code.google.com/p/maiter☆14Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- ☆217Updated 2 years ago
- 🍇 A C++ library for parallel graph processing (GRAPE) 🍇☆434Updated 5 months ago