KaHIP / KaMinParLinks
Shared-Memory and Distributed-Memory Parallel Graph Partitioning
☆40Updated last week
Alternatives and similar repositories for KaMinPar
Users that are interested in KaMinPar are comparing it to the libraries listed below
Sorting:
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆51Updated last month
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆27Updated this week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 4 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- New version of pbbs benchmarks☆92Updated 11 months ago
- ☆17Updated 3 months ago
- ☆18Updated 6 months ago
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆77Updated 3 weeks ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆439Updated 2 months 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
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 6 months ago
- Packed and Compressed Hash Tables☆15Updated 2 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆148Updated last year
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- ☆29Updated 2 weeks ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆20Updated 2 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 7 months ago
- ☆9Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- HiCMA: Hierarchical Computations on Manycore Architectures☆30Updated 2 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆53Updated 2 years ago
- CPAM: Compressed Parallel Augmented Maps☆24Updated 8 months ago