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.
☆456Updated 2 weeks 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.☆425Updated last week
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆63Updated 5 months ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 4 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Galois: C++ library for multi-core and multi-node parallelization☆323Updated 10 months ago
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering☆802Updated last year
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆122Updated 2 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- Graph partitioning for distributed GNN training☆13Updated 2 years ago
- Graph Partitioning for Large-scale Graph Datasets☆95Updated 3 years ago
- Papers on Graph Analytics, Mining, and Learning☆124Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆204Updated 3 months ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆222Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- ☆18Updated 3 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆127Updated last year
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆38Updated 4 years ago
- A Python wrapper around Metis, a graph partitioning package☆170Updated 2 weeks ago
- A C++ Library for Influence Maximization☆33Updated 3 months ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated 2 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆154Updated last year
- VF2 - Subgraph Isomorphism☆45Updated 4 years ago
- Graph Pattern Mining☆87Updated 6 months ago