darrenstrash / quick-cliquesLinks
Quickly compute all maximal cliques of a graph
☆80Updated 6 years ago
Alternatives and similar repositories for quick-cliques
Users that are interested in quick-cliques are comparing it to the libraries listed below
Sorting:
- Parallel Maximum Clique Library☆116Updated last year
- Maximum clique computation over large sparse graphs☆21Updated 3 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- Parallel Graph Input Output☆19Updated last year
- Library for performing spectral clustering in C++☆78Updated 2 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆134Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated this week
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆62Updated 4 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago
- Dynamic data structure for sparse graphs.☆29Updated last year
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- Highly parallel DBSCAN (HPDBSCAN)☆44Updated 9 months ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆224Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆162Updated 5 months ago
- Hornet data structure for sparse dynamic graphs and matrices☆85Updated 5 years ago
- High-Performance Streaming Graph Analytics on GPUs☆33Updated 6 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- PLEASE SEE THE OFFICIAL REPOSITORY. THIS IS NOT MAINTAINED ANYMORE.☆93Updated 5 years ago
- ☆12Updated 7 years ago
- Fast Fast Hadamard Transform☆81Updated 3 years ago
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated 3 weeks ago