A Novel Exact Heuristic Graph Coloring Algorithm based on Finding Independent Set

Abstract

Vertex coloring is a graph coloring technique which has a wide application area to provide solution for many real world problems. The high computational complexity of graph coloring algorithm led the development of exact heuristic algorithm which can be executed in optimal time. This paper explores some existing graph coloring algorithms to propose taxonomy of exact graph coloring algorithm which is capable to execute large graphs also. This paper presented experimental result on DIMACS graph instances. KeywordsGraph Coloring, independent set, exact algorithm, approximate algorithm, sequential algorithm and parallel algorithms.

Application of Multiobjective Optimization Integrating Numerical and Scientific Computing in Graph Theory Coloring Algorithm

“…is paper combines the MOO idea with the graph coloring algorithm and combines numerical analysis and scientific computing to propose a new algorithm. n is even and n ≥ 3 5 Objective functions and constraints in multifunctional optimization problems are generally functions with independent variables [17]. Its optimization definition is shown in formula (17):…”

“…n is even and n ≥ 3 5 Objective functions and constraints in multifunctional optimization problems are generally functions with independent variables [17]. Its optimization definition is shown in formula (17):…”