Referenced Items are not available for this document.
This paper presents an efficient technique to map the minimum vertex cover and two closely related problems (maximum independent set and maximum clique) onto the Hopfield neural networks. The proposed approach can be used to find near-optimum solutions for these problems in parallel, and particularly the network algorithm always yields minimal vertex covers. A systematic way of deriving energy functions is described. Based on these relationships, other NP-complete problems in graph theory can also be solved by neural networks. Extensive simulations were performed, and the experimental results show that the network algorithm outperforms the well-known greedy algorithm for vertex cover problems
Published in:
Computers, IEEE Transactions on
(Volume:47
,
Issue:
2
)
Date of Publication: Feb 1998
- Page(s):
- 190 - 196
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 5859411
- Digital Object Identifier :
- 10.1109/12.663765
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1998
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
