LijunChang / MC-BRBLinks
Maximum clique computation over large sparse graphs
☆23Updated 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
Sorting:
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 5 years ago
- a k-cliques algorithm☆19Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 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…☆50Updated 2 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆160Updated last year
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆31Updated 5 years ago
- Parallel Maximum Clique Library☆115Updated 2 years ago
- ☆16Updated 4 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years 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
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 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…☆117Updated last year
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 3 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆25Updated 8 years ago
- Official github repository for the paper "Efficient Unsupervised Community Search with Pre-trained Graph Transformer"☆22Updated last year
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- Graph edge partitioning algorithms☆47Updated 5 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated last year