By Topic

An algorithm for graph optimal monomorphism

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wong, A.K.C. ; Dept. of Syst. Design Eng., Waterloo Univ., Ont., Canada ; You, M. ; Chan, S.C.

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 )