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.
☆464Updated 2 months ago
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…☆140Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆435Updated last month
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆68Updated this week
- Maximum independent sets and vertex covers of large sparse graphs.☆76Updated last month
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆327Updated last year
- A Python wrapper around Metis, a graph partitioning package☆183Updated last month
- METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering☆851Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated 5 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 3 weeks ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆471Updated last year
- This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas…☆254Updated this week
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 3 years ago
- ☆20Updated 7 months ago
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- Graph Pattern Mining☆89Updated 8 months ago
- Implementation of hMETIS☆11Updated 2 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆156Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Official open source repository for "A Timing Engine Inspired Graph Neural Network Model for Pre-Routing Slack Prediction" (DAC 2022)☆74Updated 9 months ago
- REST, a reinforcement learning framework for constructing rectilinear Steiner Minimum tree (RSMT)☆55Updated 3 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- Embedding billion-scale networks accurately in one hour (TKDE paper 2023)☆11Updated last year
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆127Updated 2 years ago
- Implementation of Kernighan-Lin graph partitioning algorithm in Python☆50Updated 6 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆222Updated 3 years ago