An Efficient Memetic Algorithm for the Minimum Load Coloring Problem
Given a graph <i>G</i> with <i>n</i> vertices and <i>l</i> edges, the load distribution of a coloring <i>q</i>: <i>V →</i> {red, blue} is defined as <i>d<sub>q</sub></i> = (<i>r<sub>q</sub>...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/5/475 |