Quickly compute all maximal cliques of a graph
☆80Oct 23, 2018Updated 7 years ago
Alternatives and similar repositories for quick-cliques
Users that are interested in quick-cliques are comparing it to the libraries listed below
Sorting:
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 5 years ago
- Parallel Maximum Clique Library☆118Aug 20, 2023Updated 2 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- ☆19Aug 7, 2017Updated 8 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Nov 11, 2019Updated 6 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- A simple template for theoretical computer science assignments☆11Sep 6, 2023Updated 2 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Jan 15, 2018Updated 8 years ago
- ☆12Dec 17, 2023Updated 2 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Apr 6, 2020Updated 5 years ago
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 3 years ago
- This is a repo holding codes for the paper: Code Completion with Neural Attention and Pointer Networks☆13Mar 21, 2018Updated 7 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 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
- A benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- ☆20Oct 6, 2023Updated 2 years ago
- ☆12Feb 26, 2024Updated 2 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Sep 19, 2014Updated 11 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆32May 20, 2017Updated 8 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Jun 20, 2018Updated 7 years ago
- mini is mini☆20Jan 19, 2020Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆216Dec 23, 2025Updated 2 months ago
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 3 years ago
- Codes for TopPPR☆14Apr 25, 2019Updated 6 years ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- Random Walk (Personalized PageRank) Algorithms for Large Graphs☆74Mar 3, 2016Updated 10 years ago
- A robust algorithm for point cloud registration, using Graduated Non-Convexity and a Geman-McClure robust loss function to handle high ou…☆22Dec 19, 2025Updated 2 months ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Jan 11, 2019Updated 7 years ago
- some templates of acm-icpc☆28May 24, 2015Updated 10 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Jul 31, 2018Updated 7 years ago
- a k-cliques algorithm☆19Nov 18, 2021Updated 4 years ago
- 树洞的PC客户端☆20Jun 12, 2018Updated 7 years ago
- 基于arxiv的论文检索和阅读工具☆25Jan 4, 2022Updated 4 years ago
- Evaluating different memory managers for dynamic GPU memory☆26Dec 16, 2020Updated 5 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Sep 28, 2017Updated 8 years ago