An Efficient GA with Multipoint Guided Mutation for Graph Coloring Problems

@inproceedings{Ray2010AnEG,
  title={An Efficient GA with Multipoint Guided Mutation for Graph Coloring Problems},
  author={Biman Ray and Anindya Jyoti Pal and Debnath Bhattacharyya and Tai-Hoon Kim},
  year={2010}
}
Proper coloring of the vertices of a graph with minimum number of colors has always been of great interest of researchers in the field of soft computing. Genetic Algorithm (GA) and its application as the solution method to the Graph Coloring problem have been appreciated and worked upon by the scientists almost for the last two decades. Various genetic operators such as crossover and mutation have been used in the GA probabilistically in the previous works, which distributes the promising… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…