kahypar / mt-kahypar
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
☆126Updated this week
Related projects ⓘ
Alternatives and complementary repositories for mt-kahypar
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆433Updated this week
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆58Updated 3 weeks ago
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆35Updated this week
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆28Updated 8 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated last week
- Implementation of hMETIS☆10Updated 2 years ago
- ☆17Updated last month
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆397Updated 4 months ago
- Dynamic data structure for sparse graphs.☆27Updated 7 months ago
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆69Updated last week
- GBBS: Graph Based Benchmark Suite☆195Updated last week
- Maximum independent sets and vertex covers of large sparse graphs.☆72Updated 2 weeks ago
- This the contains the test examples and validator tool for the ISPD2021 Wafer-Scale Physics Modeling contest.☆18Updated 3 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- ☆26Updated 4 years ago
- ☆12Updated 2 months ago
- Graph Coarsening and Partitioning Library☆29Updated 4 years ago
- Parallel sparse direct solver for circuit simulation☆40Updated 2 years ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆115Updated 11 months ago
- GPU-based logic synthesis tool☆69Updated 4 months ago
- Hornet data structure for sparse dynamic graphs and matrices☆80Updated 5 years ago
- LEMON Graph Library☆32Updated 4 years ago
- C++ logic network library☆212Updated last month
- C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.☆13Updated 5 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆315Updated 6 months ago
- The first version of TritonPart☆22Updated 10 months ago
- A web interface for the SuiteSparse Matrix Collection, formerly known as the University of Florida Sparse Matrix Collection☆22Updated 3 weeks ago
- Xplace 2.0: An Extremely Fast, Extensible and Deterministic Placement Framework with Detailed-Routability Optimization☆99Updated this week