Author of the publication

Approximate the chromatic number of a graph using maximal independent sets.

, , , and . CONIELECOMP, page 19-24. IEEE, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Weighted Complete Graphs for Condensing Data., , , and . LANMR (Selected Papers), volume 354 of Electronic Notes in Theoretical Computer Science, page 45-60. Elsevier, (2019)An algorithm to approximate the chromatic number of graphs., , , and . CONIELECOMP, page 110-115. IEEE, (2015)Pattern Recognition in Road Safety: Uncovering the Latent Causes of Accidents on Mexico's Federal Highways., , , and . MCPR, volume 14755 of Lecture Notes in Computer Science, page 13-22. Springer, (2024)A Cluster-Based Under-Sampling Algorithm for Class-Imbalanced Data., , and . HAIS, volume 12344 of Lecture Notes in Computer Science, page 299-311. Springer, (2020)A Metaheuristic Algorithm to Face the Graph Coloring Problem., , , , and . HAIS, volume 12344 of Lecture Notes in Computer Science, page 195-208. Springer, (2020)Nuevos Algoritmos Basados en Grafos y Clustering para el Tratamiento de Complejidades de los Datos.. Jaume I University, Spain, (2021)Approximate the chromatic number of a graph using maximal independent sets., , , and . CONIELECOMP, page 19-24. IEEE, (2016)