article · Expert Systems · 1998
Learning classifier system for graph coloring
Cited by 0Open access
Abstract
In this paper, the use of genetic algorithms and classifiers systems in the graph coloring application was considered. A crossover derivative was developed to accommodate the graph coloring specifications. Also, a method for verifying and validating the new offspring coloring rules and regulations was considered. Through a series of experiments conducted on randomly generated graphs of a relatively small size, the importance of various parameters and their impact to the overall system performance is demonstrated and discussed. In conclusion, suggestions for future study regarding this topic are proposed and briefly discussed.
Cite this paper
Ezziane, Z. (1998). Learning classifier system for graph coloring. Expert Systems, 15(4), 240–246. https://doi.org/10.1111/1468-0394.00081
Ezziane, Zoheir. “Learning classifier system for graph coloring.” Expert Systems, vol. 15, no. 4, 1998, pp. 240–46, https://doi.org/10.1111/1468-0394.00081.
Ezziane, Zoheir. 1998. “Learning classifier system for graph coloring.” Expert Systems 15 (4): 240–46. https://doi.org/10.1111/1468-0394.00081.
Ezziane, Z. (1998) ‘Learning classifier system for graph coloring’, Expert Systems, 15(4), pp. 240–246. Available at: https://doi.org/10.1111/1468-0394.00081.
@article{ezziane1998learning,
title = {{Learning classifier system for graph coloring}},
author = {Ezziane, Zoheir},
journal = {Expert Systems},
volume = {15},
number = {4},
pages = {240--246},
year = {1998},
doi = {10.1111/1468-0394.00081}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Study of algorithm for coloring in various graph
Ayushi Malviya, Bhawna Agrawal, Sanjeet Kumar et al. · International Journal of Statistics and Applied Mathematics · 2022
Cited by 3Open access
Relation between Center Coloring and the other Colorings
Zeynep Örs Yorgancıoğlu, Pinar Dundar, Mehmet Ümit Gürsoy · Natural and Engineering Sciences · 2018
Cited by 0Open access
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
Zdenĕk Dvořák, Luke Postle · Journal of Combinatorial Theory Series B · 2017
Cited by 219Open access
Graph Coloring Problems
D. de Werra, Daniel Kobler · Wiley eBooks · 2013
Cited by 4Open access
Exact and Parameterized Algorithms for (k, i)-Coloring
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman et al. · Lecture notes in computer science · 2017
Cited by 4
Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product
Chuang Zhong, Shuangliang Tian · Journal of Physics Conference Series · 2022
Cited by 0Open access
A practical algorithm for [r, s, t]-coloring of graph
Hajar Alimorad · 2020
Cited by 0