kahypar / kahyparLinks
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
☆482Updated last month
Alternatives and similar repositories for kahypar
Users that are interested in kahypar are comparing it to the libraries listed below
Sorting:
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆152Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆445Updated 4 months ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆70Updated 3 months ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 9 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated last month
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated this week
- ☆24Updated 2 months ago
- GBBS: Graph Based Benchmark Suite☆212Updated 3 weeks ago
- Official open source repository for "A Timing Engine Inspired Graph Neural Network Model for Pre-Routing Slack Prediction" (DAC 2022)☆77Updated last year
- Galois: C++ library for multi-core and multi-node parallelization☆337Updated last year
- Graph edge partitioning algorithms☆46Updated 5 years ago
- C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.☆15Updated 5 years ago
- Implementation of hMETIS☆12Updated 3 years ago
- LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models☆23Updated 3 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated last week
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 5 months ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆87Updated this week
- GPU-based logic synthesis tool☆90Updated 3 weeks ago
- ☆57Updated 4 years ago
- ☆46Updated 2 years ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 3 years ago
- This is an official implementation for "DeepGate: Learning Neural Representations of Logic Gates".☆24Updated 2 years ago
- ☆29Updated last year
- Macro Placement - benchmarks, evaluators, and reproducible results from leading methods in open source☆278Updated 3 months ago
- EPFL logic synthesis benchmarks☆209Updated last month
- ☆32Updated 4 years ago