KaHIP / KaMinPar
Shared-Memory and Distributed-Memory Parallel Graph Partitioning
☆38Updated last week
Alternatives and similar repositories for KaMinPar:
Users that are interested in KaMinPar are comparing it to the libraries listed below
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated this week
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 2 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆50Updated last month
- Packed and Compressed Hash Tables☆15Updated last month
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆72Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- New version of pbbs benchmarks☆90Updated 10 months ago
- ☆17Updated last month
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- CPAM: Compressed Parallel Augmented Maps☆24Updated 7 months ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- ☆9Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆208Updated 4 months ago
- HiCMA: Hierarchical Computations on Manycore Architectures☆30Updated 2 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated 2 weeks ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆139Updated last year
- GPU based Compressed Graph Traversal☆16Updated last year
- ☆17Updated 4 months ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆20Updated last year
- Parallel Balanced Binary Tree Structures☆116Updated last month
- 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
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Dynamic data structure for sparse graphs.☆30Updated last year
- ☆71Updated 2 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆431Updated 2 weeks ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 6 months ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago