Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem

Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem

The graph coloring problem is an <em>NP</em>-hard combinatorial optimization problem and can be applied to various engineering applications. The chromatic number of a graph <em>G</em> is defined as the minimum number of colors required to color the vertex set <em>V</...

Full description

Bibliographic Details
Main Authors: Raja Marappan, Gopalakrishnan Sethumadhavan
Format: Article
Language:English
Published: MDPI AG 2020-02-01
Series:Mathematics
Subjects:
approximation methods
chromatic number
combinatorial optimization
complexity analysis
evolutionary approach
genetic algorithm
graph coloring
<i>np</i>-hard
stochastic convergence
Online Access:https://www.mdpi.com/2227-7390/8/3/303

Internet

https://www.mdpi.com/2227-7390/8/3/303

Similar Items