摘要
In [1], Lee, Funabiki and Takefuji proposed a parallel algorithm for solving the bipartite subgraph problem with the maximum neural networks. In this paper, we present a new algorithm based on the discrete Hopfield network to deal with the same problem. Compared with the previous maximum neural network algorithm, our method can find solutions of same quality or better with half of neurons and much less computation time. Furthermore, for the general K-partite subgraph problem, a novel interactive Hopfield network system is devised to solve it effectively. The algorithm has been implemented and the experimental results indeed demonstrate the effectiveness of our approach.
| 原文 | 英語 |
|---|---|
| 主出版物標題 | PARLE 1993 - Parallel Architectures and Languages Europe - 5th International PARLE Conference, Proceedings |
| 編輯 | Arndt Bode , Mike Reeve , Gottfried Wolf |
| 發行者 | Springer Verlag |
| 頁面 | 426-437 |
| 頁數 | 12 |
| ISBN(列印) | 9783540568919 |
| DOIs | |
| 出版狀態 | 已出版 - 1993 |
| 對外發佈 | 是 |
| 事件 | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 - Munich, 德國 持續時間: 14 06 1993 → 17 06 1993 |
出版系列
| 名字 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| 卷 | 694 LNCS |
| ISSN(列印) | 0302-9743 |
| ISSN(電子) | 1611-3349 |
Conference
| Conference | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 |
|---|---|
| 國家/地區 | 德國 |
| 城市 | Munich |
| 期間 | 14/06/93 → 17/06/93 |
文獻附註
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1993.
指紋
深入研究「Artificial neural networks for the bipartite and k-partite subgraph problems」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver