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:
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 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
- ☆19Aug 7, 2017Updated 8 years ago
- A simple template for theoretical computer science assignments☆11Sep 6, 2023Updated 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 and start building anything your business needs.
- TpX: drawing tool for TeX☆15Dec 14, 2022Updated 3 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 last month
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Nov 11, 2019Updated 6 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Jan 15, 2018Updated 8 years ago
- There are 3 datasets in this repository: Facebook, Foursquare, and Twitter.☆22Nov 17, 2023Updated 2 years ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- ☆13Feb 26, 2024Updated 2 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- ☆12Dec 17, 2023Updated 2 years ago
- Yet Another SDP Solver☆10Dec 19, 2015Updated 10 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Sep 19, 2014Updated 11 years ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 10 years ago
- Random Walk (Personalized PageRank) Algorithms for Large Graphs☆74Mar 3, 2016Updated 10 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
- 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
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A visual graph editor widget for SageMath☆10Jun 21, 2022Updated 3 years ago
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 3 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Jan 13, 2016Updated 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
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- ☆30May 7, 2017Updated 8 years ago
- Eurosys22' - Rolis: a software approach to efficiently replicating multi-core transactions☆17Feb 28, 2024Updated 2 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- Julia interface to the graph isomorphism tool nauty☆20Mar 11, 2026Updated 2 weeks 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.
- 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 5 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆17Mar 23, 2021Updated 5 years ago
- ☆15Aug 22, 2022Updated 3 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Nov 15, 2010Updated 15 years ago
- Joint registration for multiple point clouds☆11Sep 9, 2024Updated last year
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆70Feb 18, 2022Updated 4 years ago