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.
☆442Updated 2 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…☆134Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 2 months ago
- GBBS: Graph Based Benchmark Suite☆202Updated last month
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆60Updated 2 months ago
- Galois: C++ library for multi-core and multi-node parallelization☆318Updated 8 months ago
- Graph Pattern Mining☆88Updated 3 months ago
- METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering☆746Updated last year
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- Graph Partitioning for Large-scale Graph Datasets☆93Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆149Updated last year
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆220Updated 3 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Dynamic data structure for sparse graphs.☆28Updated 9 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆120Updated 2 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆34Updated 7 months ago
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- Papers on Graph Analytics, Mining, and Learning☆122Updated 2 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆126Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- A reading list for deep graph learning acceleration.☆233Updated 5 months ago
- A Python wrapper around Metis, a graph partitioning package☆170Updated last month
- Parallel Graph Input Output☆17Updated last year
- Multilevel Directed Acyclic Graph Partitioner☆28Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- open-source Pregel implementation with optimizations to reduce communication cost and eliminate skewness in communication.☆18Updated 5 years ago