On Graph Coloring Analysis Through Visualization

Dudáš, Adam; Škrinárová, Jarmila; Kiss, Á.

doi:10.1109/idt52577.2021.9497524

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• In [9], we analyze 3-edge coloring of cubic graphs using various initial edges of coloring. We present some of the problematic subgraphs and patterns that increase computing time of edge coloring of graphs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Škrinárová

Dudáš

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

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 problem is not trivial, since the number of recursions in various parts of the computation is different and causes a high load and time imbalance. We designed, implemented and experimentally verified a new decomposition method that significantly reduces the computational time for a large set of graphs (up to 404 million graphs). This method ensures the same duration of computational time for partial subtasks and thus eliminates the need to wait for synchronization of parallel computations.

show abstract

Section: Related Workmentioning

confidence: 99%

“…We have also shown the use of adjacency matrix permutation as a mean to work with these patterns and subgraphs more efficiently. Novel approach presented in this article is based directly on the work and concepts presented in [7]- [9]. These basic concepts are presented in the section V .…”

Section: Related Workmentioning

confidence: 99%