An ant algorithm for solving the four-coloring map problem
H Chen, P Zhou - 2013 Ninth International Conference on …, 2013 - ieeexplore.ieee.org
An undirected graph can demonstrate adjacency relationships among regions in a planar
map, and the four-coloring map problem is then converted into a graph vertex coloring …
map, and the four-coloring map problem is then converted into a graph vertex coloring …
[PDF][PDF] An Ant Algorithm for Solving the Four-coloring Map Problem
H Chen, P Zhou - researchgate.net
An undirected graph can demonstrate adjacency relationships among regions in a planar
map, and the fourcoloring map problem is then converted into a graph vertex coloring …
map, and the fourcoloring map problem is then converted into a graph vertex coloring …
An ant algorithm for solving the four-coloring map problem
H Chen, P Zhou - 2013 Ninth International Conference on Natural … - infona.pl
An undirected graph can demonstrate adjacency relationships among regions in a planar
map, and the four-coloring map problem is then converted into a graph vertex coloring …
map, and the four-coloring map problem is then converted into a graph vertex coloring …