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.
☆433Updated 5 months ago
Related projects ⓘ
Alternatives and complementary repositories for kahypar
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆124Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆396Updated 4 months ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆58Updated 2 weeks ago
- Maximum independent sets and vertex covers of large sparse graphs.☆70Updated this week
- METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering☆711Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆35Updated this week
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆28Updated 8 years ago
- A Python wrapper around Metis, a graph partitioning package☆161Updated last week
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- GBBS: Graph Based Benchmark Suite☆195Updated 11 months ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆119Updated 2 years ago
- Simplifying Experimental Algorithmics☆17Updated 2 months ago
- Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra☆185Updated 3 weeks ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆70Updated 4 months ago
- Galois: C++ library for multi-core and multi-node parallelization☆314Updated 5 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆145Updated last year
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆216Updated 3 years ago
- SuiteSparse graph algorithms in the language of linear algebra. For production: (default) STABLE branch. Code development: ask me for t…☆360Updated this week
- Near-linear time algorithm for computing near-maximum independent set☆17Updated 2 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Implementation of hMETIS☆10Updated 2 years ago
- C++ logic network library☆211Updated 3 weeks ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆113Updated 11 months ago
- This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas…☆230Updated this week
- Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.☆217Updated last month
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆32Updated 5 months ago
- This the contains the test examples and validator tool for the ISPD2021 Wafer-Scale Physics Modeling contest.☆18Updated 3 years ago
- Dynamic data structure for sparse graphs.☆27Updated 7 months ago
- ☆49Updated 3 years ago