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.
☆173Mar 17, 2026Updated this week
Alternatives and similar repositories for mt-kahypar
Users that are interested in mt-kahypar are comparing it to the libraries listed below
Sorting:
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆511Mar 7, 2026Updated last week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆49Updated this week
- KaHIP -- HIGH Quality Partitioning.☆474Updated this week
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Mar 1, 2026Updated 2 weeks ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 6 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- GPU-based logic synthesis tool☆100Nov 27, 2025Updated 3 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 6 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 7 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Feb 27, 2026Updated 2 weeks ago
- The first version of TritonPart☆32Jan 2, 2024Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 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…☆11Dec 19, 2022Updated 3 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 11 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆79Jan 15, 2026Updated 2 months ago
- ☆10Mar 14, 2022Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- Xplace 3.0: An Extremely Fast, Extensible and Deterministic Placement Framework with Detailed-Routability and Timing Optimization☆158Jan 16, 2026Updated 2 months ago
- A songbook about IT and computer science☆26Mar 24, 2019Updated 6 years ago
- REplicated STORagE☆13Mar 23, 2023Updated 2 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated last week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Jan 4, 2026Updated 2 months ago
- Library for VLSI CAD Design Useful parsers and solvers' api are implemented.☆194May 19, 2025Updated 10 months ago
- Heterogeneous Programming☆18Apr 24, 2023Updated 2 years ago
- ☆21Sep 15, 2024Updated last year
- ☆17Feb 11, 2026Updated last month
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- Deep learning toolkit-enabled VLSI placement☆956Feb 19, 2026Updated last month
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆28Jul 17, 2016Updated 9 years ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆11Mar 12, 2021Updated 5 years ago
- Implementation of hMETIS☆12Aug 2, 2022Updated 3 years ago
- ☆14Jul 19, 2024Updated last year
- ☆25Dec 8, 2025Updated 3 months ago
- ☆21Oct 22, 2024Updated last year
- easter egg is a flexible, high-performance e-graph library with support of multiple additional assumptions at once☆13Mar 27, 2025Updated 11 months ago
- ☆43Nov 28, 2022Updated 3 years ago
- ☆14Oct 23, 2018Updated 7 years ago
- Zoltan Dynamic Load Balancing and Graph Algorithm Toolkit -- Distribution site☆42Jun 13, 2023Updated 2 years ago