Algorithms to list k-cliques in real-world graphs
☆25Mar 4, 2021Updated 4 years ago
Alternatives and similar repositories for kClist
Users that are interested in kClist are comparing it to the libraries listed below
Sorting:
- a k-cliques algorithm☆19Nov 18, 2021Updated 4 years ago
- mini is mini☆20Jan 19, 2020Updated 6 years ago
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆32May 20, 2017Updated 8 years ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 3 years ago
- ☆28Sep 27, 2024Updated last year
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Oct 17, 2020Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆216Dec 23, 2025Updated 2 months ago
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Jun 23, 2016Updated 9 years ago
- ☆12Dec 17, 2023Updated 2 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
- High-Performance Streaming Graph Analytics on GPUs☆34Jan 28, 2019Updated 7 years ago
- ☆14Aug 14, 2024Updated last year
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 3 years ago
- ☆16Apr 2, 2024Updated last year
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 10 years ago
- ☆12Oct 18, 2023Updated 2 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
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 2 weeks ago
- A benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Nov 11, 2019Updated 6 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Sep 19, 2014Updated 11 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 C implementation of a Boldi-Vigna graph decompressor☆17Jul 5, 2016Updated 9 years ago
- PowerSwitch: a adaptive mode switch engine for distributed parrallel graph computation☆16Dec 23, 2013Updated 12 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Mar 5, 2013Updated 12 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
- A graph processing engine for hybrid CPU and GPU platforms☆38Feb 7, 2019Updated 7 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 3 years ago
- ☆16Jun 19, 2014Updated 11 years ago
- Codes for TopPPR☆14Apr 25, 2019Updated 6 years ago
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Oct 26, 2023Updated 2 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 last month
- Graph Analysis Library for directed and undirected simple graph☆21Apr 18, 2023Updated 2 years ago
- A scalable distributed graph partitioner. Ongoing research.☆15Apr 23, 2017Updated 8 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Jan 11, 2019Updated 7 years ago