Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
☆25Apr 24, 2022Updated 4 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Algorithms to list k-cliques in real-world graphs☆24Mar 4, 2021Updated 5 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16May 25, 2020Updated 6 years ago
- Exact Structural Graph Clustering☆13Mar 19, 2022Updated 4 years ago
- Maximum clique computation over large sparse graphs☆24Mar 19, 2022Updated 4 years ago
- Source code of our paper for our paper: Accelerating Biclique Counting on GPU☆15Mar 5, 2024Updated 2 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 8 months ago
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆32Jun 4, 2020Updated 6 years ago
- Official github repository for the paper "Efficient Unsupervised Community Search with Pre-trained Graph Transformer"☆27May 14, 2024Updated 2 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- Quickly compute all maximal cliques of a graph☆83Oct 23, 2018Updated 8 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 years ago
- An open implementation of the MC family of maximum clique algorithms☆14Aug 4, 2016Updated 10 years ago
- 🏆 The winner code for Neurips'23 BigANN Competition OOD and Sparse track.☆16Jun 17, 2025Updated last year
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆166Oct 26, 2023Updated 2 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Everything you always wanted to know about ANNS but were afraid to ask 🥰☆12Dec 21, 2024Updated last year
- ☆14Aug 5, 2021Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Jun 7, 2026Updated 4 months ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆18Oct 18, 2020Updated 6 years ago
- ☆16Apr 2, 2024Updated 2 years ago
- taeguk's vim settings☆12Mar 26, 2016Updated 10 years ago
- 数据库管理系统的一个简单实现 a simple implementation of DBMS☆16Jan 10, 2024Updated 2 years 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 4 years ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Jun 18, 2021Updated 5 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆27Sep 22, 2015Updated 11 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆17Apr 23, 2021Updated 5 years ago
- ☆12Oct 18, 2023Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- Parallel Maximum Clique Library☆124Aug 20, 2023Updated 3 years ago
- GPU based Compressed Graph Traversal☆16Jan 9, 2026Updated 9 months ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆24May 4, 2014Updated 12 years ago
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆20Nov 9, 2025Updated 11 months ago
- A distributed in-memory store for temporal knowledge graphs☆10Mar 20, 2024Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Contrast Subgraph Mining from Coherent Cores☆13Feb 20, 2018Updated 8 years ago
- ☆21Jan 8, 2023Updated 3 years ago
- HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management☆37Sep 16, 2022Updated 4 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 11 years ago
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆17Sep 6, 2024Updated 2 years ago
- Approximate Graph Propagation☆11Oct 30, 2021Updated 4 years ago
- flutter与原生通信的3种方式具体实现☆11Feb 28, 2019Updated 7 years ago