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☆25Mar 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
- SCAN: A Structural Clustering Algorithm for Networks python implementation☆12Jun 11, 2015Updated 11 years ago
- Maximum clique computation over large sparse graphs☆24Mar 19, 2022Updated 4 years ago
- ☆10Aug 2, 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.
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12May 29, 2019Updated 7 years 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
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 4 months ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- ☆19Apr 11, 2026Updated 2 months 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☆13Aug 4, 2016Updated 9 years ago
- Everything you always wanted to know about ANNS but were afraid to ask 🥰☆12Dec 21, 2024Updated last year
- GBBS: Graph Based Benchmark Suite☆225Jun 2, 2026Updated last month
- 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.
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Jun 7, 2026Updated last month
- ☆14Aug 5, 2021Updated 4 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
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆18Oct 18, 2020Updated 5 years 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
- Source code of our paper for our paper: Accelerating Biclique Counting on GPU☆15Mar 5, 2024Updated 2 years ago
- a k-cliques algorithm☆19Nov 18, 2021Updated 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
- ☆12Dec 17, 2023Updated 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.
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆16Apr 23, 2021Updated 5 years ago
- HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management☆35Sep 16, 2022Updated 3 years ago
- Parallel Maximum Clique Library☆122Aug 20, 2023Updated 2 years ago
- A general graph manipulation python module☆16Jun 2, 2009Updated 17 years ago
- A distributed in-memory store for temporal knowledge graphs☆10Mar 20, 2024Updated 2 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- ☆12Oct 18, 2023Updated 2 years ago
- MemLiner is a remote-memory-friendly runtime system.☆31Nov 1, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- A graph pattern mining framework for large graphs on gpu.☆16Dec 9, 2024Updated last year
- Approximate Graph Propagation☆11Oct 30, 2021Updated 4 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Feb 20, 2018Updated 8 years ago
- Detachable, Dynamic combination, cloud native, modern DB infrastructure☆12Sep 17, 2024Updated last year
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Mar 28, 2018Updated 8 years ago
- Multilinear PageRank☆15May 10, 2017Updated 9 years ago
- Further development has been moved to a new repository https://github.com/wangyiqiu/dbscan-python☆18Feb 13, 2023Updated 3 years ago