Quickly compute all maximal cliques of a graph
☆82Oct 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
- 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
- A simple template for theoretical computer science assignments☆12Sep 6, 2023Updated 2 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.
- TpX: drawing tool for TeX☆16Apr 28, 2026Updated 2 months 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
- 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
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- ☆28Sep 27, 2024Updated last year
- ☆12Dec 17, 2023Updated 2 years ago
- Model and represent Simplicial Complexes and their Cochains. Provides a clean interface to calculate Betti numbers and (discrete) Hodge d…☆18Jun 25, 2026Updated last week
- 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.
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Mar 10, 2019Updated 7 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 11 years ago
- Random Walk (Personalized PageRank) Algorithms for Large Graphs☆75Mar 3, 2016Updated 10 years ago
- Linewise Non-Rigid Point Cloud Registration (C++)☆36Dec 9, 2022Updated 3 years ago
- ☆19Oct 6, 2023Updated 2 years ago
- 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 benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- A visual graph editor widget for SageMath☆11Jun 21, 2022Updated 4 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 2022Updated 4 years ago
- GBBS: Graph Based Benchmark Suite☆225Jun 2, 2026Updated last month
- JavaScript client for UpCloud's API☆13May 25, 2021Updated 5 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 8 years ago
- NodeJS bindings for Google CityHash☆28Apr 18, 2013Updated 13 years ago
- ☆30May 7, 2017Updated 9 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☆12Oct 12, 2020Updated 5 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 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
- contributions to Giac computer algebra system☆15Apr 1, 2023Updated 3 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Nov 15, 2010Updated 15 years ago
- taeguk's vim settings☆12Mar 26, 2016Updated 10 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☆73Feb 18, 2022Updated 4 years ago