Benchmark Sets and Experimental Results for "Parallel Unconstrained Local Search for Partitioning Irregular Graphs"

set_r.tar.xz: benchmark set of 33 large regular graphs (i.e., graphs with low degree variance, such as mesh graphs). Referenced as set R or in our publications. All graphs are unweighted and in Metis format set_i.tar.xz: benchmark set of 38 large irregular graphs (i.e., graphs with high degree variance, such as social networks). Referenced as set I or in our publications. The recomp_XXX instances have edge weights, while the remaining graphs are unweighted. Metis format stats_regular.csv: general statistics on the benchmark set of regular graphs stats_irregular.csv: general statistics on the benchmark set of irregular graphs results_alenex24.zip: experimental results for our paper "Parallel Unconstrained Local Search for Partitioning Irregular Graphs" (ALENEX 2024) results_acda25.zip: experimental results for our paper "Deterministic Parallel High-Quality Hypergraph Partitioning" (ACDA 2025)