By Topic

Neural network approach to graph colouring

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 $31
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

3 Author(s)
Rahman, S.A. ; Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India ; Jayadeva ; Dutta Roy, S.C.

A neural network for colouring a graph of N nodes is proposed which uses only N neurons and N2 weights. In contrast, N2 neurons and N4 interconnections are required by Hopfield net based approaches. Experiments with a breadboard realisation using discrete components yielded promising results

Published in:

Electronics Letters  (Volume:35 ,  Issue: 14 )