Journal ArticleOPEN ACCESS

Parallel genetic algorithm for graph coloring problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3036 215-222
DOI: 10.1007/978-3-540-24685-5_27
17Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and define two new recombination operators: SPPX and CEX. For comparison two recently proposed crossover operators: UISX and GPX are selected. The performance of the algorithm is verified by computer experiments on a set of standard graph coloring instances. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Kokosiński, Z., Kolodziej, M., & Kwarciany, K. (2004). Parallel genetic algorithm for graph coloring problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3036, 215–222. https://doi.org/10.1007/978-3-540-24685-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free