KaHIP / KaMinParLinks
Shared-Memory and Distributed-Memory Parallel Graph Partitioning
☆43Updated this 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 2 weeks ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆146Updated 2 weeks ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆51Updated last month
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆27Updated last week
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆79Updated last week
- Hornet data structure for sparse dynamic graphs and matrices☆85Updated 5 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- New version of pbbs benchmarks☆94Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- Sympiler is a Code Generator for Transforming Sparse Matrix Codes☆43Updated 2 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated last week
- HiCMA: Hierarchical Computations on Manycore Architectures☆30Updated 2 years ago
- Reference implementation of the draft C++ GraphBLAS specification.☆33Updated 4 months ago
- ☆75Updated this week
- Simplified Interface to Complex Memory☆28Updated last year
- GPU based Compressed Graph Traversal☆16Updated last year
- ☆30Updated last week
- mallocMC: Memory Allocator for Many Core Architectures☆58Updated 2 months ago
- ☆9Updated 6 years ago
- ☆36Updated last week
- A C++ Library for Influence Maximization☆33Updated 7 months ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆21Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 3 months ago
- Dynamic data structure for sparse graphs.☆29Updated last year
- Scalable High-performance Algorithms and Data-structures☆132Updated last month
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 8 months ago
- ☆17Updated 3 months ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆150Updated last year
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago