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.
☆180May 12, 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…☆518Mar 7, 2026Updated 2 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆53Updated this week
- KaHIP -- HIGH Quality Partitioning.☆480Apr 15, 2026Updated last month
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13May 9, 2026Updated last week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- 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.
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- GPU-based logic synthesis tool☆102Mar 31, 2026Updated last month
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 8 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆43Updated this week
- The first version of TritonPart☆34Jan 2, 2024Updated 2 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆88Jan 15, 2026Updated 4 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆10Mar 14, 2022Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 7 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☆163Jan 16, 2026Updated 4 months ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 2 months ago
- Heterogeneous Programming☆18Apr 24, 2023Updated 3 years ago
- Library for VLSI CAD Design Useful parsers and solvers' api are implemented.☆196May 19, 2025Updated last year
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 4 months ago
- 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.
- ☆21Sep 15, 2024Updated last year
- ☆17Feb 11, 2026Updated 3 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 11 months ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆28Jul 17, 2016Updated 9 years ago
- Deep learning toolkit-enabled VLSI placement☆994Apr 24, 2026Updated 3 weeks ago
- Implementation of hMETIS☆12Aug 2, 2022Updated 3 years ago
- ☆14Jul 19, 2024Updated last year
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- ☆22Oct 22, 2024Updated last year
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- ☆26Dec 8, 2025Updated 5 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
- ☆14Oct 23, 2018Updated 7 years ago
- Zoltan Dynamic Load Balancing and Graph Algorithm Toolkit -- Distribution site☆43Jun 13, 2023Updated 2 years ago
- ☆14Jan 3, 2018Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated last year