Quickly compute all maximal cliques of a graph
☆83Oct 23, 2018Updated 8 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☆24Mar 19, 2022Updated 4 years ago
- Algorithms to list k-cliques in real-world graphs☆24Mar 4, 2021Updated 5 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- A simple template for theoretical computer science assignments☆12Sep 6, 2023Updated 3 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 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.
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 8 months ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Sep 19, 2014Updated 12 years ago
- There are 3 datasets in this repository: Facebook, Foursquare, and Twitter.☆22Nov 17, 2023Updated 2 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Nov 11, 2019Updated 6 years ago
- ☆10Oct 17, 2021Updated 5 years ago
- Implementation of branch and bound algorithm for maximum clique problem☆35Dec 16, 2017Updated 8 years ago
- Hybrid BFS on Xilinx Zynq☆18Jun 9, 2015Updated 11 years ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- Yet Another SDP Solver☆10Dec 19, 2015Updated 10 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.
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Mar 10, 2019Updated 7 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Jun 24, 2019Updated 7 years ago
- Model and represent Simplicial Complexes and their Cochains. Provides a clean interface to calculate Betti numbers and (discrete) Hodge d…☆19Sep 18, 2026Updated last month
- Cross-platform headers-only C++11 framework for streaming data packets through a graph of data-transforming nodes☆15Aug 8, 2015Updated 11 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
- ☆16Apr 2, 2024Updated 2 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Jan 13, 2016Updated 10 years ago
- A benchmark suite for Graph Machine Learning☆18Oct 8, 2024Updated 2 years ago
- Highly interactive graph data visualization☆15Oct 13, 2021Updated 5 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.
- Eurosys22' - Rolis: a software approach to efficiently replicating multi-core transactions☆17Feb 28, 2024Updated 2 years ago
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- Parallel k-core Decomposition on Multicore Platforms☆12Oct 12, 2020Updated 6 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
- GBBS: Graph Based Benchmark Suite☆225Oct 11, 2026Updated 3 weeks ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 years ago
- A low-overhead, task-based threading API using a thread-pool of C++11 threads☆11Oct 29, 2018Updated 8 years ago
- DACE: A Scalable DP-means Algorithm for Clustering Extremely Large Sequence Data☆10May 22, 2016Updated 10 years ago
- ☆30May 7, 2017Updated 9 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.
- Linewise Non-Rigid Point Cloud Registration (C++)☆36Dec 9, 2022Updated 3 years ago
- Parallel Maximum Clique Library☆30May 9, 2025Updated last year
- ☆13Sep 8, 2021Updated 5 years ago
- A complex network mining and visualization system☆13Jun 23, 2014Updated 12 years ago
- ☆12Oct 18, 2023Updated 3 years ago
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆73Feb 18, 2022Updated 4 years ago
- Joint registration for multiple point clouds☆11Sep 9, 2024Updated 2 years ago