A deep learning guided memetic framework for graph coloring problems

Abstract

Given an undirected graph $G=(V,E)$ with a set of vertices $V$ and a set of edges $E$, a graph coloring problem involves finding a partition of the vertices into different independent sets. In this paper we present a new framework that combines a deep neural network with the best tools of classical metaheuristics for graph coloring. The proposed method is evaluated on two popular graph coloring problems (vertex coloring and weighted coloring). Computational experiments on well-known benchmark graphs show that the proposed approach is able to obtain highly competitive results for both problems. A study of the contribution of deep learning in the method highlights that it is possible to learn relevant patterns useful to obtain better solutions to graph coloring problems.

References in corpus (6)

• Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
• Learning Combinatorial Optimization Algorithms over Graphs
• Deep Set Prediction Networks
• A memetic algorithm for the minimum sum coloring problem
• Coloring Big Graphs with AlphaGoZero
• Mixed batches and symmetric discriminators for GAN training