CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A NonñLinear Feedback Neural Network for Graph Coloring

by Mohd. Samar Ansari, Syed Atiqur Rahman, Syed Javed Arif
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 16
Year of Publication: 2012
Authors: Mohd. Samar Ansari, Syed Atiqur Rahman, Syed Javed Arif
10.5120/4906-7417

Mohd. Samar Ansari, Syed Atiqur Rahman, Syed Javed Arif . A NonñLinear Feedback Neural Network for Graph Coloring. International Journal of Computer Applications. 39, 16 ( February 2012), 31-33. DOI=10.5120/4906-7417

@article{ 10.5120/4906-7417,
author = { Mohd. Samar Ansari, Syed Atiqur Rahman, Syed Javed Arif },
title = { A NonñLinear Feedback Neural Network for Graph Coloring },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 16 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 31-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number16/4906-7417/ },
doi = { 10.5120/4906-7417 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:26:37.446755+05:30
%A Mohd. Samar Ansari
%A Syed Atiqur Rahman
%A Syed Javed Arif
%T A NonñLinear Feedback Neural Network for Graph Coloring
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 16
%P 31-33
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A feedback neural network for solving graph coloring problem is presented. The circuit has an associated transcendental energy function that ensures fast convergence to the exact solution. Hardware and PSPICE simulation results on random and benchmark problems have been presented. Test results are compared with existing techniques for graph coloring to show that the proposed neural network model provides a significant reduction in the number of colors while enjoying a simple and efficient circuit implementation.

References
  1. Zeitlhofer, T. and Wess, B. 2004. A Comparison of Graph Coloring Heuristics for Register Allocation based on Coalescing in Interval Graphs. Proc. ISCAS 04, vol. IV, 529 – 532.
  2. El-Fishawy, N.A., Hadhood, M. M., Elnoubi, S., and El-Sersy, W.2000. A modified Hopfield neural network algorithm for cellular radio channel assignment. Proc. TENCON 2000, 2, 213 – 216.
  3. Blas, A.D., Jagota, A., and Hughey, R. 2002. Energy Function – Based Approaches to Graph Coloring. IEEE Trans. On Neural Networks, 13, 81–91.
  4. Rahman, S.A., Jayadeva and Dutta Roy, S.C. 1999. Neural network approach to graph colouring. Electronics Letters, 35(14), 1173–1175.
  5. Wu, C.W. 1998. Graph Coloring via Synchronization of Coupled Oscillators. IEEE Trans. Circuits Syst. I, 45(9), 974–978.
  6. Lui, J., Zhong, W., and Jiao, L.2006. Comments on “The 1993 DIMACS Graph Coloring Challenge” and “Energy Function-Based Approaches to Graph Coloring” IEEE Trans. On Neural Networks, 17(2), 533.
  7. Newcomb, R.W. and Lohn, J.D.1998. Analog VLSI for neural networks in The Handbook of Brain Theory and Neural Networks. Cambridge, MA: The MIT Press.
Index Terms

Computer Science
Information Sciences

Keywords

Neural network applications Neural network hardware Non-linear circuits Graph theory Dynamical Systems Non-Linear Synapse Feedback Networks

Powered by PhDFocusTM