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.
☆501Updated this week
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…☆167Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆469Updated last month
- Implementation of the HYPE hypergraph partitioner.☆22Updated 6 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆76Updated 2 weeks ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 9 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- Galois: C++ library for multi-core and multi-node parallelization☆342Updated last year
- GBBS: Graph Based Benchmark Suite☆214Updated 4 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last month
- C++ logic network library☆267Updated 2 months ago
- ☆25Updated 6 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆45Updated this week
- EPFL logic synthesis benchmarks☆222Updated 3 weeks ago
- Official open source repository for "A Timing Engine Inspired Graph Neural Network Model for Pre-Routing Slack Prediction" (DAC 2022)☆84Updated last year
- GPU-based logic synthesis tool☆97Updated 2 weeks ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated 3 months ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆91Updated this week
- LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models☆25Updated 3 years ago
- Papers on Graph Analytics, Mining, and Learning☆127Updated 3 years ago
- Graph edge partitioning algorithms☆48Updated 6 years ago
- This is an official implementation for "DeepGate: Learning Neural Representations of Logic Gates".☆24Updated 2 years ago
- Implementation of hMETIS☆13Updated 3 years ago
- OpenABC-D is a large-scale labeled dataset generated by synthesizing open source hardware IPs. This dataset can be used for various graph…☆141Updated 4 months ago
- Multi-way hypergraph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by…☆21Updated 4 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆90Updated 6 years ago
- ☆58Updated 4 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆36Updated 4 months ago
- Showcase examples for EPFL logic synthesis libraries☆201Updated last year
- A circuit toolkit☆106Updated 5 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆232Updated 4 years ago