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.
☆187Jun 22, 2026Updated last week
Alternatives and similar repositories for mt-kahypar
Users that are interested in mt-kahypar are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆523Mar 7, 2026Updated 3 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆54Updated this week
- KaHIP -- HIGH Quality Partitioning.☆488Apr 15, 2026Updated 2 months ago
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13May 21, 2026Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- GPU-based logic synthesis tool☆106Mar 31, 2026Updated 2 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 8, 2025Updated 9 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 10 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆44Jun 21, 2026Updated last week
- The first version of TritonPart☆35Jan 2, 2024Updated 2 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆90Jan 15, 2026Updated 5 months 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
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 3 years ago
- ☆11Mar 14, 2022Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 8 months ago
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 years ago
- Xplace 3.0: An Extremely Fast, Extensible and Deterministic Placement Framework with Detailed-Routability and Timing Optimization☆167Updated this week
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 3 months ago
- Heterogeneous Programming☆18Apr 24, 2023Updated 3 years ago
- Library for VLSI CAD Design Useful parsers and solvers' api are implemented.☆197May 19, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 5 months ago
- ☆21Sep 15, 2024Updated last year
- ☆18Feb 11, 2026Updated 4 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated last year
- 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"☆13Mar 12, 2021Updated 5 years ago
- Deep learning toolkit-enabled VLSI placement☆1,019Apr 24, 2026Updated 2 months ago
- Implementation of hMETIS☆12Aug 2, 2022Updated 3 years ago
- ☆14Jul 19, 2024Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- ☆22Oct 22, 2024Updated last year
- ☆27Dec 8, 2025Updated 6 months ago
- easter egg is a flexible, high-performance e-graph library with support of multiple additional assumptions at once☆13Mar 27, 2025Updated last year
- ☆43Nov 28, 2022Updated 3 years ago
- Zoltan Dynamic Load Balancing and Graph Algorithm Toolkit -- Distribution site☆43Jun 13, 2023Updated 3 years ago
- A High-performance Timing Analysis Tool for VLSI Systems☆10Feb 11, 2021Updated 5 years ago