A practical approach for map coloring considering of greedy algorithm

The goal of a map coloring problem is to color a map so that regions sharing a common border have different colors, map-coloring problem is a classic NP-complete graph optimization problem, which has many real-world applications. From analyzing the characters of greedy algorithm, we proposed a new map coloring approach, which includes sorting the coloring regions based on the touch number among each region, and then coloring the regions using greedy algorithm. The proposed practical algorithm overcomes the disadvantage of greedy algorithm in the field of Map-coloring, and the results show that the proposed algorithms can solve the problem of coloring administrative map efficiently and obtain optimal solutions.