An algorithm based on Hopfield network learning for minimum vertex cover problem

Xiaoming Chen*, Zheng Tang, Xinshun Xu, Songsong Li, Guangpu Xia, Jiahai Wang

*この論文の責任著者

研究成果: 書籍の章/レポート/会議録査読

3 被引用数 (Scopus)

抄録

An efficient algorithm for the minimum vertex cover problem based on Hopfield neural network leaning is presented. The learning algorithm has two phases, the Hopfield network phase and the learning phase. When network gets stuck in local minimum, the learning phase is performed in an attempt to fill up the local minimum valley by modifying parameter in a gradient ascent direction of the energy function. The proposed algorithm is tested on benchmark graphs. The simulation results show that the proposed algorithm is an effective algorithm for the minimum vertex cover problem in terms of the computation time and solution quality.

本文言語英語
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Fuliang Yin, Chengan Guo, Jun Wang
出版社Springer Verlag
ページ430-435
ページ数6
ISBN(印刷版)3540228411, 9783540228417
DOI
出版ステータス出版済み - 2004

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3173
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

ASJC Scopus 主題領域

  • 理論的コンピュータサイエンス
  • コンピュータサイエンス一般

フィンガープリント

「An algorithm based on Hopfield network learning for minimum vertex cover problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル