摘要
图的顶点覆盖问题是一个困难的NP-完全问题,并且有许多良好的应用.文中将在已有的应用Hopfield神经网络模型来求解图的顶点覆盖问题的基础上,将人脑决策思维的思想加入其中,建立称为图顶点覆盖问题决策神经网络模型.该方法不仅简化了过去此领域的工作,而且通过增加决策约束项,加速了网络的运行速度.
Graph vertex-covering problem is a NP-complete problem. It can be used to many aspects. This paper is aimed to establish a kind of graph vertex-covering problem neural networks model that are of local-connection, of simulation human＇s decision-making thinking, called graph vertex-covering problem decision-making neural network model. The advantages of the model can be converged in speed than Hopfield neural network.
出处
《计算机学报》
EI
CSCD
北大核心
2009年第8期1683-1686,共4页
Chinese Journal of Computers
基金
supported by the National Natural Science Foundation of China(No.60774036)
关键词
决策神经网络
图的顶点覆盖问题
decision-making neural network
vertex-covering problem
