Evolutionary Algorithm for Graph Coloring Problem

by   Robiul Islam, et al.

The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color and that the number of used colors, is minimal. Different heuristic, meta-heuristic, machine learning and hybrid solution methods have been applied to obtain the solution. To solve this problem we use mutation of evolutionary algorithm. For this purpose we introduce binary encoding for Graph Coloring Problem. This binary encoding help us for mutation, evaluate, immune system and merge color easily and also reduce coloring dynamically. In the traditional evolutionary algorithm (EA) for graph coloring, k-coloring approach is used and the EA is run repeatedly until the lowest possible is reached. In our paper, we start with the theoretical upper bound of chromatic number, that is, maximum out-degree + 1 and in the process of evolution some of the colors are made unused to dynamically reduce the number of color in every generation. We test few standard DIMACS benchmark and compare resent paper. Maximum results are same as expected chromatic color and few data sets are larger than expected chromatic number



There are no comments yet.


page 1

page 2

page 3

page 4


A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs

A b-coloring of a graph G is a proper coloring of its vertices such that...

Two-Class (r,k)-Coloring: Coloring with Service Guarantees

This paper introduces the Two-Class (r,k)-Coloring problem: Given a fixe...

A note on the simultaneous edge coloring

Let G=(V,E) be a graph. A (proper) k-edge-coloring is a coloring of the ...

JCOL: A Java package for solving the graph coloring problem

The graph coloring problem aims at assigning colors to the nodes of a gr...

Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation

Register allocation, which is a crucial phase of a good optimizing compi...

Optimality Clue for Graph Coloring Problem

In this paper, we present a new approach which qualifies or not a soluti...

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

We contribute to the theoretical understanding of randomized search heur...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.