kahypar / kahypar
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.
☆448Updated 3 months ago
Alternatives and similar repositories for kahypar:
Users that are interested in kahypar are comparing it to the libraries listed below
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆138Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆418Updated last week
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆62Updated 3 months ago
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆201Updated 2 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 3 months ago
- Galois: C++ library for multi-core and multi-node parallelization☆319Updated 9 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Showcase examples for EPFL logic synthesis libraries☆192Updated 10 months ago
- METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering☆778Updated last year
- Implementation of hMETIS☆10Updated 2 years ago
- A Python wrapper around Metis, a graph partitioning package☆168Updated this week
- Graph partitioning for distributed GNN training☆12Updated last year
- GraphIt - A High-Performance Domain Specific Language for Graph Analytics☆376Updated 2 years ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆129Updated last year
- Graph edge partitioning algorithms☆45Updated 5 years ago
- ☆43Updated 3 weeks ago
- C++ logic network library☆221Updated 4 months ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆120Updated 2 years ago
- REST, a reinforcement learning framework for constructing rectilinear Steiner Minimum tree (RSMT)☆54Updated 2 years ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆37Updated 4 years ago
- Macro Placement - benchmarks, evaluators, and reproducible results from leading methods in open source☆244Updated 3 months ago
- Distributed Graph Mining on a Massive "Single" Graph☆14Updated 4 years ago
- A circuit toolkit☆97Updated 4 years ago