Solving four-coloring map problems using strictly digital neural networks
Katsuhiko Murakami, T. Nakagawa, H. Kitagawa · 1991
A parallel algorithm with SDNNs (strictly digital neural networks) for solving four-coloring problems on combinatorial optimization problems is presented. This problem was defined as a set selection problem with the k-out-of-n design rule and was solved efficiently by an SDNN software simulator with the parallel algorithm. Solving this large problem with a sequential algorithm takes several hours. The simulation results of SDNN show that four-colour map problems can be solved not only within O(n) in parallel convergence but also O(n/sup 2/) in sequential simulation, where n is the number of regions. A comparison with two other algorithms shows the efficiency of the SDNN algorithm.>