Graphs

Benchmark Suite #

The largest collection of benchmark graphs is 📖 Adolfo Piperno’s collection. It is the de-facto default benchmark library, which we thoroughly test in our benchmarks. Below, we give some additional or extended graph classes for testing, and a justification as to why they are interesting.

All these graphs were tested in our benchmarks.

mip17 #

[Download ] Graphs stemming from symmetry exploitation in mixed-integer solvers, in particular from instances of the MIPLIB 2017. This set was provided by Marc Pfetsch and Christopher Hojny.

sat21 #

[Download ] Graphs made from the SAT competition instances of 2021. The CNF instances were first preprocessed using the unit and pure literal rule. This removes some symmetries which are not interesting in the context of the application.

pace23 #

[Download ] Graphs from the pace challenge 2023. Many of the graphs contain twins and a lot of very sparse symmetries. The graphs were taken from the original benchmark suite and converted to the DIMACS format.

groups128 #

[Download ] Graph encoding of the multiplication tables of groups of order 128. Symmetry detection can be used to compute the automorphism group of the underlying group. This set was provided by Jendrik Brachter.

cfixl #

[Download ] The cfi set (Cai-Fürer-Immerman graphs) from the bliss distribution, extended with larger graphs.

kxl #

[Download ] The k set (complete graphs) from the bliss distribution, extended with larger graphs.