Dataset and Code for Engineering Hypergraph $b$-Matching Algorithms

This data set contains the weighted hypergraphs and graphs used in experiments, along side the results file for the paper and code: Engineering Hypergraph $b$-Matching Algorithms by Ernestine Großmann, Felix Joos, Henrik Reinstädtler and Christian Schulz The data set contains 488 medium sized hypergraphs, originally collected by Gottesbürren et al. [1]. The hypergraphs were augmented with edge-weights from the range of [1,100]. Vertex weights were assigned uniform at random between 1 and the vertex-degree. The results files contain the experimental results used in the paper along side with the plotting definition file. The code is provided under MIT-License. [1] **Scalable High-Quality Hypergraph Partitioning** *Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, and Sebastian Schlag* (2023). Available at: [https://doi.org/10.48550/arXiv.2303.17679](https://doi.org/10.48550/arXiv.2303.17679)