darrenstrash / quick-cliquesLinks
Quickly compute all maximal cliques of a graph
☆79Updated 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
- Parallel Graph Input Output☆19Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 6 months ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- 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
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated 2 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆84Updated 5 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- ☆12Updated 7 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
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆31Updated 5 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 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
- Graph Challenge☆31Updated 5 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 10 months ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆223Updated 3 years ago