### Abstract

The performance guarantees of the Hopfield network are given for two simple graph problems. A lower bound of cutsize is evaluated for the maximum cut problem through the analysis of eigenvalues at equilibrium states. The condition of constraint satisfaction and an upper bound of the cutsize are given for the graph bipartitioning problem. In addition, an effective numerical scheme is proposed to integrate the differential equations of the Hopfield network by using the backward Euler formula with one-step Gauss-Seidel relaxation. Theoretical estimates of the performance of the algorithm are verified experimentally.

Original language | English |
---|---|

Pages (from-to) | 1412-1415 |

Number of pages | 4 |

Journal | Unknown Journal |

Volume | 3 |

Publication status | Published - 1991 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials

## Fingerprint Dive into the research topics of 'Performance evaluation of Hopfield network for simple examples'. Together they form a unique fingerprint.

## Cite this

Urahama, K. (1991). Performance evaluation of Hopfield network for simple examples.

*Unknown Journal*,*3*, 1412-1415.