darrenstrash / quick-cliquesLinks
Quickly compute all maximal cliques of a graph
☆80Updated 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
Sorting:
- Parallel Maximum Clique Library☆119Updated 2 years ago
- Parallel Graph Input Output☆18Updated 2 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
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆137Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆215Updated last month
- Library for performing spectral clustering in C++☆80Updated 2 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆234Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Updated 7 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆28Updated last week
- ☆50Updated 3 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆169Updated 11 months ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Updated 5 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…☆64Updated 7 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- Fast Fast Hadamard Transform☆89Updated 4 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 5 years ago
- PLEASE SEE THE OFFICIAL REPOSITORY. THIS IS NOT MAINTAINED ANYMORE.☆93Updated 6 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆90Updated 6 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- This is a cross-platform, CUDA-based C++ library for general-purpose, unconstrained nonlinear optimization on the GPU. It implements the …☆138Updated 5 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆26Updated 8 years ago
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated last month
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆33Updated last year
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆418Updated 2 months ago