darrenstrash / quick-cliquesLinks
Quickly compute all maximal cliques of a graph
☆78Updated 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☆19Updated 3 years ago
- Parallel Graph Input Output☆19Updated last year
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 5 months ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- Library for performing spectral clustering in C++☆78Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 3 weeks ago
- ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo☆31Updated 5 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 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
- Dynamic data structure for sparse graphs.☆30Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆14Updated 2 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Updated 2 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆84Updated 5 years ago
- gSparse: C++ Library for Graph Sparsification☆12Updated 5 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- High-Performance Streaming Graph Analytics on GPUs☆32Updated 6 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
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- Vienna Graph Clustering☆16Updated 4 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆25Updated last year