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☆115Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- Parallel Graph Input Output☆20Updated 2 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☆136Updated 2 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…☆27Updated 2 months ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Library for performing spectral clustering in C++☆79Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Updated 6 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆230Updated 4 years ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- ☆24Updated 2 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆87Updated 5 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
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆372Updated 4 months ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Updated 4 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆25Updated 8 years ago
- 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
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆449Updated 4 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- A Library for fast Hash Tables on GPUs☆126Updated 3 years ago
- ☆48Updated 3 years ago
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated 3 weeks ago