By Topic

k-coloring vertices using a neural network with convergence to valid solutions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Berger, M.O. ; Lehrstuhl fur Informatik IV, Tech. Hochschule Aachen, Germany

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

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994