Optimization of the Functional Decomposition of Parallel and Distributed Computations in Graph Coloring With the Use of High-Performance Computing

This article presents methods for correct decomposition for high performance computations related to large sets of graphs. These computations contain large number of calls of sequential, recursive algorithm for NP-complete problem - proper edge coloring of graph. Decomposition of this computational...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 10; s. 34996 - 35011
Hlavní autoři:	Skrinarova, Jarmila, Dudas, Adam
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Computational efficiency Computing time Decomposition distributed computing Graph coloring Graphs High performance computing Image color analysis Load management NP-complete problem Optimization parallel computing Parallel processing Program processors Resource management snark Synchronism Task analysis
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!