Quantum inspired cuckoo search algorithm for graph colouring problem


The graph coloring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimization problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph coloring problem using a new… (More)
DOI: 10.1504/IJBIC.2015.069554


17 Figures and Tables