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.
help wanted
Extra attention is needed
good first issue
Good for newcomers
convenience
Syntax improvements that don't significantly change functionality
utilities
Has to do with utility functions such as WolframModelRuleData, HypergraphUnifications, etc.
The jBPT code library is a compendium of technologies that support research on design, execution, and evaluation of business processes. The library offers a broad range of basis analysis and utility functionality and, due to its open publishing model, can easily be extended.
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel hypergraph partitioner equipped with parallel implementations of techniques employed in most sequential state-of-the-art hypergraph partitioners. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
The problem
It would be nice to have an operator form of
HypergraphToGraph, e.g.,would be equivalent to