LijunChang / MC-BRB
Maximum clique computation over large sparse graphs
☆19Updated 3 years ago
Alternatives and similar repositories for MC-BRB:
Users that are interested in MC-BRB are comparing it to the libraries listed below
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 2 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Quickly compute all maximal cliques of a graph☆78Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆155Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 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…☆49Updated 2 years ago
- a k-cliques algorithm☆19Updated 3 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 4 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 8 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- ☆16Updated 4 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Official github repository for the paper "Efficient Unsupervised Community Search with Pre-trained Graph Transformer"☆21Updated 11 months ago
- ☆17Updated 4 months ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆60Updated last year
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 4 years ago
- ☆13Updated 3 years ago
- Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…☆80Updated 4 months ago
- ☆27Updated 2 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆30Updated 2 years ago
- Master's thesis project involving label-constrained reachability (LCR)Updated 4 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago