Lehr- und Forschungsgebiet Diskrete Optimierung

Projekt: Branch- and Bound Algorithmen für das equitable Graphenfärbungsproblem

Förderung: DFG Exellence Initiative

Lehrstuhl II für Mathematik, Lehr- und Forschungsgebiet Diskrete Optimierung

RWTH Aachen University

Overview / The equitable coloring problem / Code and Data /

Downloads

C++ Code

Download: (link)

We distribute our code for academic usage. We kindly ask you to cite our corresponding works if you publish further results based on this code. For a commercial usage please contact one of the members of the project.

Instances

We test our algorithms on random graphs, generated according to the Erdős-Rényi model (n,p). These graphs consist of n nodes, whereas p denotes the probability that there is an edge between each two nodes. The graphs are in DIMACS format. We test on groups of 200 instances with

n = 45, 50, 55, 60, 65, 70, 75, 80,
p = 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.8, 0.9.

Download: (link) 27.6 Mb.

last modified: 23/12/2016 - 08:16