Title :
A New Algorithm for Graph Monomorphism Based on the Projections of the Product Graph
Author :
Akinniyi, Folorunso A. ; Wong, Andrew K.C. ; Stacey, Deborah A.
Author_Institution :
Systems Design Engineering Department, University of Waterloo, Waterloo, ON, Canada now with the Federal Agricultural Coordinating Unit, Ibadan, Nigeria, on leave from the University of Lagos, Lagos, Nigeria
Abstract :
A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkers, is more efficient in its storage space utilization and average execution time. It does not suffer from the ambiguity which arises in Deo et al.´s work when cyclic graphs are matched. Applications to attributed graph monomorphisms are included.
Keywords :
Agricultural engineering; Algorithm design and analysis; Chemical analysis; Design engineering; Image analysis; Iterative algorithms; Partitioning algorithms; Polynomials; Systems engineering and theory; Tree graphs;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
DOI :
10.1109/TSMC.1986.289319
