darrenstrash / quick-cliques
Quickly compute all maximal cliques of a graph
☆75Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for quick-cliques
- Parallel Maximum Clique Library☆109Updated last year
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- Parallel Graph Input Output☆17Updated last year
- Maximum clique computation over large sparse graphs☆18Updated 2 years ago
- Library for performing spectral clustering in C++☆77Updated last year
- GBBS: Graph Based Benchmark Suite☆195Updated last week
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 5 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 12 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆18Updated 5 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆131Updated last year
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆30Updated 4 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆30Updated 7 years ago
- ☆10Updated 7 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆80Updated 5 years ago
- Dynamic data structure for sparse graphs.☆27Updated 7 months ago
- ☆23Updated 2 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 7 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆218Updated 3 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆52Updated 3 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆30Updated 6 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆142Updated 3 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆28Updated 5 years ago
- Library for finding maximum cliques on graphs☆15Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- Fast and full-featured Matrix Market I/O library for C++, Python, and R☆75Updated 3 months ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆20Updated last year