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.
☆489Updated last 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…☆163Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆462Updated 6 months ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆72Updated last week
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 2 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 3 weeks ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 9 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆342Updated last year
- Implementation of hMETIS☆13Updated 3 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆44Updated this week
- ☆24Updated 4 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.☆16Updated 6 years ago
- Showcase examples for EPFL logic synthesis libraries☆198Updated last year
- C++ logic network library☆258Updated last month
- ☆34Updated 4 years ago
- Official open source repository for "A Timing Engine Inspired Graph Neural Network Model for Pre-Routing Slack Prediction" (DAC 2022)☆81Updated last year
- GPU-based logic synthesis tool☆92Updated 2 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- REST, a reinforcement learning framework for constructing rectilinear Steiner Minimum tree (RSMT)☆58Updated 3 years ago
- Graph edge partitioning algorithms☆47Updated 6 years ago
- A Simple CDCL Solver☆34Updated 2 years ago
- EPFL logic synthesis benchmarks☆213Updated last month
- Pursuing the best performance of linear solver in circuit simulation☆40Updated last month
- ☆59Updated 4 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated 2 months ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- Parallel sparse direct solver for circuit simulation☆48Updated 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…☆136Updated 3 months ago