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
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆216Updated last month
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆138Updated 2 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆28Updated 2 weeks ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 13 years ago
- Library for performing spectral clustering in C++☆80Updated 2 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆234Updated 4 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Updated 5 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Updated 7 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆26Updated 8 years ago
- A warp-oriented dynamic hash table for GPUs☆76Updated 2 years ago
- A Library for fast Hash Tables on GPUs☆132Updated 3 months ago
- Hornet data structure for sparse dynamic graphs and matrices☆90Updated 6 years ago
- Graph Coarsening and Partitioning Library☆33Updated 5 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 5 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆473Updated 3 weeks ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- ☆26Updated 3 years ago
- Fast and full-featured Matrix Market I/O library for C++, Python, and R☆86Updated last year
- Dynamic data structure for sparse graphs.☆31Updated last year
- ☆51Updated 3 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆32Updated 8 years ago