An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm


We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Douglas–Rachford algorithm was recently shown to be a successful heuristic for solving a wide variety of graph coloring instances, when the problem was cast as a feasibility problem on binary indicator variables. In this work we consider a different formulation, based on semidefinite programming. The much improved performance of the Douglas–Rachford algorithm, with this new approach, is demonstrated through various numerical experiments.F. J. Aragón Artacho and R. Campoy were partially supported by MICINN of Spain and ERDF of EU, Grants MTM2014-59179-C2-1-P and PGC2018-097960-B-C22. F. J. Aragón Artacho was supported by the Ramón y Cajal program by MINECO of Spain and ERDF of EU (RYC-2013-13327) and R. Campoy was supported by MINECO of Spain and ESF of EU (BES-2015-073360) under the program “Ayudas para contratos predoctorales para la formación de doctores 2015”

Similar works

Full text


Repositorio Institucional de la Universidad de Alicante

Last time updated on 13/05/2020

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.