Topic: "hypergraph-partitioning"
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.
Language: C++ - Size: 133 MB - Last synced at: 16 days ago - Pushed at: 3 months ago - Stars: 464 - Forks: 96
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.
Language: C++ - Size: 34.9 MB - Last synced at: 9 days ago - Pushed at: 10 days ago - Stars: 140 - Forks: 29
kahypar/research-publications
A list of all publications related to the KaHyPar frameworks.
Size: 22.5 KB - Last synced at: over 2 years ago - Pushed at: about 3 years ago - Stars: 5 - Forks: 3
kotatsuyaki/cad-net-partition 📦
Multiple-way hypergraph partitioning based on simulated annealing (Moved to Codeberg)
Language: C++ - Size: 4.49 MB - Last synced at: 3 months ago - Pushed at: about 2 years ago - Stars: 3 - Forks: 0
gullolan/Hypergraph_partitioning
IP formulations for hypergraph partitioning problems
Language: Jupyter Notebook - Size: 1.16 MB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 1 - Forks: 0
Inazuma110/HCBE.jl
Hypergraph(or bipartite graph) clustering algorithm.
Language: Julia - Size: 9.48 MB - Last synced at: 3 months ago - Pushed at: about 4 years ago - Stars: 1 - Forks: 0
