RapidsAtHKUST / ppSCAN
ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo
☆30Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for ppSCAN
- ☆10Updated 7 years ago
- Quickly compute all maximal cliques of a graph☆75Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 3 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆29Updated 3 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆15Updated 3 weeks ago
- ☆8Updated 7 years ago
- ☆23Updated 2 years ago
- ☆13Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆148Updated last year
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- 1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…☆14Updated 4 years ago
- ☆60Updated last year
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆52Updated 3 months ago
- Open Resources For network embedding☆16Updated 4 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆28Updated 5 years ago
- Deeper insights into graph convolutional networks for semi-supervised learning☆19Updated 5 years ago
- Codes for TopPPR☆13Updated 5 years ago
- a k-cliques algorithm☆17Updated 3 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…☆42Updated last year
- ☆15Updated 2 years ago
- Maximum clique computation over large sparse graphs☆18Updated 2 years ago
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆18Updated 3 weeks ago
- Y. Zhang, Q. Yao, J. Kwok. Bilinear Scoring Function Search for Knowledge Graph Learning. TPAMI 2022☆68Updated 11 months ago
- ☆35Updated 4 years ago