Rainbow connectivity using a rank genetic algorithm: Moore Cages with Girth Six
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...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | México |
| Institución: | Universidad Autónoma Metropolitana |
| Repositorio: | Concentración de Recursos de Información Científica y Académica, UAM Cuajimalpa |
| Idioma: | inglés |
| OAI Identifier: | oai:ilitia.cua.uam.mx:123456789/518 |
| Acceso en línea: | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/518 |
| Access Level: | acceso abierto |
| Palabra clave: | info:eu-repo/classification/cti/7 Algoritmos genéticos Optimización matemática |
| Sumario: | 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. |
|---|