Shared-Memory and Distributed-Memory Parallel Graph Partitioning
☆58Jul 28, 2026Updated 2 weeks ago
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:
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 8, 2025Updated 11 months ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆193Aug 5, 2026Updated last week
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 10 months ago
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 3 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 7 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 11 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Jul 22, 2026Updated 3 weeks ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated last year
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13Updated this week
- Vienna Graph Clustering☆18Jun 1, 2026Updated 2 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆36Apr 7, 2025Updated last year
- Learned Monotone Minimal Perfect Hashing☆32Apr 1, 2025Updated last year
- Embedding billion-scale networks accurately in one hour (TKDE paper 2023)☆11Sep 26, 2023Updated 2 years ago
- Experimental Explicit Communications API for Kokkos☆39Jul 16, 2026Updated 3 weeks ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Aug 6, 2025Updated last year
- Skriptartiger Mitschrieb für die Vorlesung Moderne Physik für Informatiker, SS15/17, KIT☆21Apr 25, 2019Updated 7 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Dec 5, 2019Updated 6 years ago
- Scalable Automated Reasoning for HPC and Clouds☆93Updated this week
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- ☆33Oct 28, 2020Updated 5 years ago
- The Ipe extensible drawing editor☆268Jun 26, 2026Updated last month
- ☆15Nov 20, 2023Updated 2 years ago
- Asynchronous I/O for HDF5☆24Feb 10, 2026Updated 6 months ago
- GBBS: Graph Based Benchmark Suite☆226Jun 2, 2026Updated 2 months ago
- Agentic Algorithm Engineering☆24Apr 3, 2026Updated 4 months ago
- ☆23Mar 31, 2021Updated 5 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Mar 23, 2026Updated 4 months ago
- PaStiX (Parallel Sparse matriX package) solver library☆20Nov 20, 2018Updated 7 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.
- Graph edge partitioning algorithms☆47Oct 17, 2019Updated 6 years ago
- 🏆 The winner code for Neurips'23 BigANN Competition OOD and Sparse track.☆15Jun 17, 2025Updated last year
- Minimalistic puzzle game☆104Jul 28, 2026Updated 2 weeks ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆90Aug 4, 2026Updated last week
- C++ library for graph ordering☆15Mar 20, 2020Updated 6 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆32Jan 23, 2019Updated 7 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆48Jun 4, 2026Updated 2 months ago