International Journal of Parallel Programming

Multi-core shared memory architectures have become ubiquitous in computing hardware nowadays. As a result, there is a growing need to fully utilize these architectures by introducing appropriate parallelization schemes, such as OpenMP worksharing-...

The Vertex Graph Coloring problem ($\mathcal{VGC}$) is a well-known difficult combinatorial optimization problem. It is one of Karp’s 21 NP-complete problems. It consists in assigning a color to each vertex of a graph in such a way that any two neighboring ...$\mathcal{}$