Quickly compute all maximal cliques of a graph
☆83Oct 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☆24Mar 19, 2022Updated 4 years ago
- Algorithms to list k-cliques in real-world graphs☆24Mar 4, 2021Updated 5 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- Parallel Maximum Clique Library☆124Aug 20, 2023Updated 3 years ago
- An open implementation of the MC family of maximum clique algorithms☆14Aug 4, 2016Updated 10 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- 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
- ☆19Aug 7, 2017Updated 9 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 8 months ago
- TpX: drawing tool for TeX☆16Updated this week
- 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
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆28Sep 27, 2024Updated 2 years ago
- ☆12Dec 17, 2023Updated 2 years ago
- Implementation of branch and bound algorithm for maximum clique problem☆35Dec 16, 2017Updated 8 years ago
- (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 12 years ago
- 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☆89Jun 24, 2019Updated 7 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
- GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators☆34Apr 3, 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.
- Cross-platform headers-only C++11 framework for streaming data packets through a graph of data-transforming nodes☆15Aug 8, 2015Updated 11 years ago
- A low-overhead, task-based threading API using a thread-pool of C++11 threads☆11Oct 29, 2018Updated 7 years ago
- Linewise Non-Rigid Point Cloud Registration (C++)☆36Dec 9, 2022Updated 3 years ago
- ☆16Apr 2, 2024Updated 2 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
- ☆30May 7, 2017Updated 9 years ago
- A Dataflow library for graph analytics acceleration☆14Dec 15, 2015Updated 10 years ago
- Highly interactive graph data visualization☆15Oct 13, 2021Updated 5 years ago
- taeguk's vim settings☆12Mar 26, 2016Updated 10 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Parallel k-core Decomposition on Multicore Platforms☆12Oct 12, 2020Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 years ago
- ☆13Sep 8, 2021Updated 5 years ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Jun 18, 2021Updated 5 years ago
- Script for doing Slurm Calculations☆12Jul 20, 2026Updated 2 months ago
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆73Feb 18, 2022Updated 4 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Nov 15, 2010Updated 15 years ago