LijunChang / Cohesive_subgraph_bookView external linksLinks
Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
☆26Apr 24, 2022Updated 3 years ago
Alternatives and similar repositories for Cohesive_subgraph_book
Users that are interested in Cohesive_subgraph_book are comparing it to the libraries listed below
Sorting:
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16May 25, 2020Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 4 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12May 29, 2019Updated 6 years ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 3 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Apr 6, 2020Updated 5 years ago
- MemLiner is a remote-memory-friendly runtime system.☆31Nov 1, 2022Updated 3 years ago
- An open implementation of the MC family of maximum clique algorithms☆12Aug 4, 2016Updated 9 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Nov 15, 2021Updated 4 years ago
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆32Jun 4, 2020Updated 5 years ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆17Oct 18, 2020Updated 5 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- Source code of our paper for our paper: Accelerating Biclique Counting on GPU☆14Mar 5, 2024Updated last year
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Oct 26, 2023Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Mar 28, 2018Updated 7 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆24May 4, 2014Updated 11 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Mar 3, 2020Updated 5 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Nov 24, 2018Updated 7 years ago
- GBBS: Graph Based Benchmark Suite☆216Dec 23, 2025Updated last month
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Dec 20, 2018Updated 7 years ago
- Official github repository for the paper "Efficient Unsupervised Community Search with Pre-trained Graph Transformer"☆25May 14, 2024Updated last year
- HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management☆35Sep 16, 2022Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Mar 1, 2018Updated 7 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆26Jun 8, 2017Updated 8 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Jan 23, 2019Updated 7 years ago
- Parallel Maximum Clique Library☆119Aug 20, 2023Updated 2 years ago
- A red teaming agent☆18Oct 15, 2025Updated 4 months ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Jun 30, 2022Updated 3 years ago
- ☆29Feb 2, 2017Updated 9 years ago
- ☆25Jan 2, 2021Updated 5 years ago
- An experimentation platform for LLM inference optimisation☆35Sep 19, 2024Updated last year
- Boki: Stateful Serverless Computing with Shared Logs [SOSP '21]☆84May 13, 2022Updated 3 years ago
- Libraries, guides, blueprints, and sample code, to enable rapidly building 0-1 applications on iOS, Android and web.☆11May 12, 2023Updated 2 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36May 29, 2021Updated 4 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Jan 15, 2021Updated 5 years ago
- Implementation for paper2repo☆11Dec 7, 2020Updated 5 years ago
- ☆20Jun 29, 2022Updated 3 years ago