Referenced Items are not available for this document.
An algorithm for finding the optimal monomorphism between two attributed graphs is proposed. The problem is formulated as a tree search problem. To guide the search the branch-and-bound heuristic approach is adopted, using an efficient consistent lower bounded estimate for the evaluation function of the cost associated with the optimal solution path in the search tree. The algorithm is a generalization of an algorithm for graph optimal isomorphism. The algorithm's potential for engineering application is demonstrated by a simple structural pattern recognition problem and a plant allocation and distribution problem
Published in:
Systems, Man and Cybernetics, IEEE Transactions on
(Volume:20
,
Issue:
3
)
Date of Publication: May/Jun 1990
- Page(s):
- 628 - 638
- ISSN :
- 0018-9472
- INSPEC Accession Number:
- 3746668
- Digital Object Identifier :
- 10.1109/21.57275
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May/Jun 1990
- Sponsored by :
- IEEE Systems, Man, and Cybernetics 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.
