Answers are grounded in this paper and cite their sources.
In this paper, we proposed an improved cuckoo search optimization (ICS) algorithm for solving planar graph coloring problem. The improved cuckoo search optimization algorithm is consisting of the walking one strategy, swap and inversion strategy and greedy strategy. The proposed improved cuckoo search optimization algorithm can solve the planar graph coloring problem using four-colors more efficiently and accurately. The experimental results show that we proposed improved cuckoo search optimization algorithm can get smaller average iterations and higher correction coloring rate.
No takes yet. Share an insight, caveat, or question.
Zhou et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: