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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 4 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
- An open implementation of the MC family of maximum clique algorithms☆13Aug 4, 2016Updated 9 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 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.
- A simple template for theoretical computer science assignments☆11Sep 6, 2023Updated 2 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 2 months ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- ☆28Sep 27, 2024Updated last year
- ☆13Feb 26, 2024Updated 2 years ago
- ☆12Dec 17, 2023Updated 2 years ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 11 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.
- community detection in multiplex networks☆10Apr 23, 2016Updated 10 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Jun 24, 2019Updated 6 years ago
- Implementation of branch and bound algorithm for maximum clique problem☆35Dec 16, 2017Updated 8 years ago
- Linewise Non-Rigid Point Cloud Registration (C++)☆36Dec 9, 2022Updated 3 years ago
- ☆19Oct 6, 2023Updated 2 years ago
- A benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- Cross-platform headers-only C++11 framework for streaming data packets through a graph of data-transforming nodes☆15Aug 8, 2015Updated 10 years ago
- A low-overhead, task-based threading API using a thread-pool of C++11 threads☆11Oct 29, 2018Updated 7 years ago
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 4 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- GBBS: Graph Based Benchmark Suite☆226Apr 12, 2026Updated 3 weeks ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Nov 17, 2015Updated 10 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
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- ☆30May 7, 2017Updated 8 years 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
- High-Fidelity 3D Reconstruction via Graph Optimization. A Multi-Frame Registration and reconstruction algorithm.☆16Jan 11, 2024Updated 2 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 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.
- Script for doing Slurm Calculations☆12Mar 21, 2025Updated last year
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Jun 18, 2021Updated 4 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- A robust algorithm for point cloud registration, using Graduated Non-Convexity and a Geman-McClure robust loss function to handle high ou…☆23Dec 19, 2025Updated 4 months ago
- taeguk's vim settings☆12Mar 26, 2016Updated 10 years ago
- Joint registration for multiple point clouds☆11Sep 9, 2024Updated last year
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆33May 20, 2017Updated 8 years ago