Título: | Rainbow connectivity using a rank genetic algorithm: Moore Cages with Girth Six |
Autor(es): | CERVANTES OJEDA, JORGE GOMEZ FUENTES, MARIA DEL CARMEN GONZALEZ MORENO, DIEGO ANTONIO OLSEN, MIKA |
Temas: | Algoritmos genéticos Optimización matemática |
Fecha: | 2019 |
Editorial: | Egipto : Hindawi |
Citation: | Journal of applied mathematics, vol. 2019 |
Resumen: | A rainbow -coloring of a -connected graph is an edge coloring such that for any two distinct vertices and of there are at least internally vertex-disjoint rainbow -paths. In this work, we apply a Rank Genetic Algorithm to search for rainbow -colorings of the family of Moore cages with girth six -cages. We found that an upper bound in the number of colors needed to produce a rainbow 4-coloring of a -cage is 7, improving the one currently known, which is 13. The computation of the minimum number of colors of a rainbow coloring is known to be NP-Hard and the Rank Genetic Algorithm showed good behavior finding rainbow -colorings with a small number of colors. |
URI: | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/518 |
Aparece en las colecciones: | Artículos |
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Rainbow connectivity.pdf | 1.55 MB | Adobe PDF | Visualizar/Abrir |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.