Chinese Journal of Computers   Full Text
Title	A Graph Vertex-Covering Problem Decision-Making Neural Network Model
Authors	NAN Jin-Hua QI Huan
Address	(Department of Control Science and Engineering, Huazhong University of Science & Technology, Wuhan 430074)
Year	2009
Issue	No.8(1683—1686)
Abstract &   Background	Abstract 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. Keywords decision-making neural network; vertex-covering problem Background This research is supported by the National Natural Science Foundation of China(No.60774036). It is well-known that Hopfield neural networks are applied to solve some optimization problems for many years. However, Hopfield neural networks is a kind of fully connected network, that is any two artificial neural neurons can be linked. Thus, the run times and local minimal values are greatly increased. To overcome the phenomena, we propose a novel artificial neural network model, called decision-making neural network model. Furthermore, the computing model is set up by decision-making neural network model for a graph vertex-covering problem .