Shared-Memory and Distributed-Memory Parallel Graph Partitioning
☆60Oct 26, 2026Updated last week
Alternatives and similar repositories for KaMinPar
Users that are interested in KaMinPar are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 3 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…☆10Dec 19, 2022Updated 3 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆203Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 23, 2026Updated last month
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 6 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- KaHIP -- HIGH Quality Partitioning.☆503Sep 16, 2026Updated last month
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 9 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆45Sep 28, 2026Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Jun 27, 2023Updated 3 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Aug 31, 2026Updated 2 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 7 months ago
- Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg☆28Apr 24, 2026Updated 6 months ago
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated last month
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 years ago
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13Updated this week
- ☆22Oct 22, 2024Updated 2 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.
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆541Mar 7, 2026Updated 7 months ago
- Experimental Explicit Communications API for Kokkos☆41Oct 20, 2026Updated 2 weeks ago
- Jet: Graph Partitioner for GPU☆16May 13, 2025Updated last year
- A list of all publications related to the KaHyPar frameworks.☆12Apr 23, 2022Updated 4 years ago
- discontinuous Galerkin CFD solver with automated, unstructured quad/hex meshing☆14Jan 30, 2026Updated 9 months ago
- ☆45Jun 13, 2025Updated last year
- ☆12Sep 24, 2021Updated 5 years ago
- ☆32Oct 28, 2020Updated 6 years ago
- ☆15Nov 20, 2023Updated 2 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.
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Jan 22, 2026Updated 9 months ago
- The Ipe extensible drawing editor☆280Updated this week
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆136Jan 15, 2025Updated last year
- ☆11Oct 24, 2022Updated 4 years ago
- Asynchronous I/O for HDF5☆24Feb 10, 2026Updated 8 months ago
- LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.☆12Jun 14, 2022Updated 4 years ago
- Agentic Algorithm Engineering☆32Updated this week