Genetic algorithm and edge-colorings of complete graphs with connected classes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916507411283968 |
|---|---|
| author | Cervantes-Ojeda, Jorge Gómez-Fuentes, María C. Rubio-Montiel, Christian |
| author_facet | Cervantes-Ojeda, Jorge Gómez-Fuentes, María C. Rubio-Montiel, Christian |
| contents | In this study, the Rank Genetic Algorithm was adapted to address a problem in the field of Chromatic Graph Theory, namely, on the parameter called the connected-pseudoachromatic index. We successfully improved several previously known bounds of that index of the complete graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01811 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Genetic algorithm and edge-colorings of complete graphs with connected classes Cervantes-Ojeda, Jorge Gómez-Fuentes, María C. Rubio-Montiel, Christian Combinatorics 05C15, 05C85 In this study, the Rank Genetic Algorithm was adapted to address a problem in the field of Chromatic Graph Theory, namely, on the parameter called the connected-pseudoachromatic index. We successfully improved several previously known bounds of that index of the complete graph. |
| title | Genetic algorithm and edge-colorings of complete graphs with connected classes |
| topic | Combinatorics 05C15, 05C85 |
| url | https://arxiv.org/abs/2405.01811 |