Greedy and Backtracking Algorithm Comparison in Graph Coloring Problem

Abstract.   Graph Coloring is a technique of coloring vertices on a graph so that no neighboring nodes have the same color. Usually this is also associated with minimal use of color. Graph coloring techniques are one of the most interesting and well-known subjects in the field of graphics. The theory of graph coloring has been developed with various algorithms to solve it, one of them is Greedy Algorithm and Backtracking Algorithm. In this blog we do analytic design algorithm to solve graph coloring using greedy algorithm and backtracking algorithm and find the ‘m’ (minimum) colors if possible.  The graph coloring problem is a practical method of representing many real world problems including time scheduling, frequency assignment, register allocation, and circuit board testing. The most important fact that makes graph coloring exciting is that finding the minimum number of colors for an arbitrary graph is NP-hard. This blog implements Greedy algorithms and Backtracking algorithm to fi