Neural network solutions to a graph theoretic problem
Y. Shrivastava, Soura Dasgupta, Sudhakar M. Reddy · 2002
A Hopfield-model-based solution to the node covering problem is considered. It is shown that the sequential algorithm is always convergent, and that for an n-node graph, this convergence occurs in no more than 2n iterations. For the parallel algorithm, a resetting scheme guaranteeing convergence is proposed. Detailed analyses of both schemes are given.>