Algorithms to list k-cliques in real-world graphs
☆25Mar 4, 2021Updated 5 years ago
Alternatives and similar repositories for kClist
Users that are interested in kClist are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 years ago
- a k-cliques algorithm☆19Nov 18, 2021Updated 4 years ago
- 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
- ☆16Apr 2, 2024Updated 2 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- ☆12Oct 18, 2023Updated 2 years ago
- ☆14Aug 14, 2024Updated last year
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Mar 5, 2013Updated 13 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 3 months ago
- ☆28Sep 27, 2024Updated last year
- Graph Analysis Library for directed and undirected simple graph☆21Apr 18, 2023Updated 3 years ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 4 years ago
- GBBS: Graph Based Benchmark Suite☆225Apr 12, 2026Updated last month
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆33May 20, 2017Updated 9 years ago
- mini is mini☆20Jan 19, 2020Updated 6 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Oct 17, 2020Updated 5 years ago
- High-Performance Streaming Graph Analytics on GPUs☆35Jan 28, 2019Updated 7 years ago
- A subgraph enumeration framework☆14Oct 20, 2017Updated 8 years ago
- ☆12Dec 17, 2023Updated 2 years ago
- Distributed Multi-GPU GNN Framework☆36Jun 26, 2020Updated 5 years ago
- A C++ Pregel Clone with dynamic load balancing, based on a paper "Mizan: A System for Dynamic Load Balancing in Large-scale Graph Process…☆27Dec 3, 2013Updated 12 years ago
- PowerSwitch: a adaptive mode switch engine for distributed parrallel graph computation☆16Dec 23, 2013Updated 12 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.
- Parallel Maximum Clique Library☆120Aug 20, 2023Updated 2 years ago
- We design a Monte Carlo based method, UniWalk, to enable the fast top-k SimRank computation over large undirected graphs. UniWalk directl…☆12Nov 9, 2017Updated 8 years ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 11 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆166Oct 26, 2023Updated 2 years ago
- A benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆71Feb 18, 2022Updated 4 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Jun 11, 2021Updated 4 years ago
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Jun 23, 2016Updated 9 years ago
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 4 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.
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- A scalable distributed graph partitioner. Ongoing research.☆15Apr 23, 2017Updated 9 years ago
- A benchmarking suite for heterogeneous systems. The primary goal of this project is to improve and update aspects of existing benchmarkin…☆43Jan 30, 2026Updated 3 months ago
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Nov 17, 2015Updated 10 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Nov 11, 2019Updated 6 years ago