A Non-linear Synapse Neural Network with O(N) Neurons for Graph Colouring

Syed Atiqur Rahman, Mohd Kashif
{"title":"A Non-linear Synapse Neural Network with O(N) Neurons for Graph Colouring","authors":"Syed Atiqur Rahman, Mohd Kashif","doi":"10.1109/IMPACT55510.2022.10029148","DOIUrl":null,"url":null,"abstract":"A feedback artificial neural network with nonlinear synaptic connections is proposed for the classical graph colouring problem. The network employs O(N) Neurons with O(N2) non-linear synapses for a graph with N nodes. The network has a transcendental energy function that is fundamentally different from Hopfield Network. The proposed network always converges to a feasible solution, with the number of assigned colours being nearly equal to the Chromatic number of the corresponding graph. HSPICE simulation confirms the functioning of the proposed circuit. The results are compared with the existing circuits to highlight the significant reduction in the number of colours required for colouring a given graph.","PeriodicalId":300301,"journal":{"name":"2022 5th International Conference on Multimedia, Signal Processing and Communication Technologies (IMPACT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Multimedia, Signal Processing and Communication Technologies (IMPACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMPACT55510.2022.10029148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A feedback artificial neural network with nonlinear synaptic connections is proposed for the classical graph colouring problem. The network employs O(N) Neurons with O(N2) non-linear synapses for a graph with N nodes. The network has a transcendental energy function that is fundamentally different from Hopfield Network. The proposed network always converges to a feasible solution, with the number of assigned colours being nearly equal to the Chromatic number of the corresponding graph. HSPICE simulation confirms the functioning of the proposed circuit. The results are compared with the existing circuits to highlight the significant reduction in the number of colours required for colouring a given graph.
一种用于图着色的O(N)神经元非线性突触神经网络
针对经典的图着色问题,提出了一种具有非线性突触连接的反馈人工神经网络。对于一个有N个节点的图,网络使用O(N)个神经元和O(N2)个非线性突触。该网络具有与Hopfield网络根本不同的先验能量函数。该网络总是收敛于一个可行解,分配的颜色数几乎等于对应图的色数。HSPICE仿真验证了所提出电路的功能。将结果与现有电路进行比较,以突出显示为给定图形着色所需颜色数量的显着减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书