This repository provides an implementation of graph coloring algorithms using Backtracking, Greedy, and Dynamic Programming approaches. Users can select their preferred method to efficiently color a ...

Graph Coloring is the process of assigning colors to the vertices of a graph such that no two adjacent vertices share the same color. The main goal is to use the minimum number of colors possible ...

Abstract: Coloring a graph is a known and a classical problem in graph theory. It is also a known NP problem. In a graph G, the solution of coloring a graph is about coloring all the vertices of the ...

Abstract: Graphics processing units (GPUs) have been increasingly used to accelerate irregular applications such as graph and sparse-matrix computation. Graph coloring is a key building block for many ...