k-coloring vertices using a neural network with convergence to valid solutions
M.O. Berger · 2002
Proposes an algorithm using a maximum neural network model to k-color vertices of a simple undirected graph. Unlike traditional neural nets, the proposed network is guaranteed to converge to valid solutions with no parameter tuning needed. The power of the new method to solve this NP-complete problem is shown in a number of simulations.>