English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The graph coloring problem belongs to the problem class NP-Hard, so unless the problem class P is equal to the class NP , there is no polynomial algorithm to solve it . Despite its high complexity, the development of algorithms for these types of problems are of the utmost importance due to the fact that the problems NP-Hard appear in almost all areas of computer science as machine learning , computer networks, operating systems, information systems, among others. In this paper, we propose a parallel implementation, based on CUDA, of a set of variants of a hybrid evolutionary algorithm for the problem of coloring graphs. This

Algoritmos híbridos paralelos para el problema de coloreado de grafos