Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kahypar/mt-kahypar
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
https://github.com/kahypar/mt-kahypar
algorithm-engineering graph-algorithms graph-partitioning graphs high-performance-computing hypergraph hypergraph-partitioning hypergraphs parallel-computing partitioning partitioning-algorithms shared-memory tbb
Last synced: 3 months ago
JSON representation
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
- Host: GitHub
- URL: https://github.com/kahypar/mt-kahypar
- Owner: kahypar
- License: mit
- Created: 2019-09-02T14:54:18.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2024-06-07T22:14:33.000Z (8 months ago)
- Last Synced: 2024-06-07T22:29:24.182Z (8 months ago)
- Topics: algorithm-engineering, graph-algorithms, graph-partitioning, graphs, high-performance-computing, hypergraph, hypergraph-partitioning, hypergraphs, parallel-computing, partitioning, partitioning-algorithms, shared-memory, tbb
- Language: C++
- Homepage:
- Size: 34 MB
- Stars: 104
- Watchers: 7
- Forks: 21
- Open Issues: 7
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
- awesome-oneapi - mt-kahypar - MT-KaHyPar is a multi-threaded algorithm for partitioning graphs and hypergraphs. It aims to minimize an objective function defined on the hyperedges while balancing block sizes and optimizing connectivity. It can partition extremely large graphs and hypergraphs with comparable solution quality to the best sequential graph partitioners while being more than an order of magnitude faster with only ten threads. (Table of Contents / Mathematics and Science)