3 citations · 5 across the 4 of their papers we have counts for
4 papers
Genetic algorithm and edge-colorings of complete graphs with connected classes
Jorge Cervantes-Ojeda, María C. Gómez-Fuentes, Christian Rubio-Montiel
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 in…
A procedure to obtain symmetric cycles of any odd length using directed Hajós constructions
Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda
The dichromatic number of a digraph is the minimum number of colors of a vertex coloring of such that has no monochromatic cycles. The Hajós join were recently extended…
How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm
Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda
In 2020 Bang-Jensen et. al. generalized the Hajós join of two graphs to the class of digraphs and generalized several results for vertex colorings in digraphs. Although, as a conse…
A few filters are enough: Convolutional Neural Network for P300 Detection
Alicia Montserrat Alvarado-Gonzalez, Gibran Fuentes-Pineda, Jorge Cervantes-Ojeda
Over the past decade, convolutional neural networks (CNNs) have become the driving force of an ever-increasing set of applications, achieving state-of-the-art performance. Most of…