Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | PARLE 1993 - Parallel Architectures and Languages Europe - 5th International PARLE Conference, Proceedings |
| Editors | Arndt Bode , Mike Reeve , Gottfried Wolf |
| Publisher | Springer Verlag |
| Pages | 426-437 |
| Number of pages | 12 |
| ISBN (Print) | 9783540568919 |
| DOIs | |
| State | Published - 1993 |
| Externally published | Yes |
| Event | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 - Munich, Germany Duration: 14 06 1993 → 17 06 1993 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 694 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 |
|---|---|
| Country/Territory | Germany |
| City | Munich |
| Period | 14/06/93 → 17/06/93 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1993.
Fingerprint
Dive into the research topics of 'Artificial neural networks for the bipartite and k-partite subgraph problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver