An Algorithm for Graph Optimal Monomorphism

IEEE Transactions on Systems, Man and Cybernetics

Volumn 20, Issue 3, 1990, Pages 628-638

  Wong, A K C ^a   You, M ^a   Chan, S C ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--HEURISTIC; OPERATIONS RESEARCH; PATTERN RECOGNITION;

BRANCH-AND-BOUND HEURISTIC ALGORITHM; GRAPH OPTIMAL ISOMORPHISM; GRAPH OPTIMAL MONOMORPHISM; PLANT ALLOCATION/DISTRIBUTION PROBLEM; SEARCH METHODS; TREE SEARCH PROBLEM;

DECISION SUPPORT SYSTEMS;

EID: 0025431841     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.57275     Document Type: Article

References (19)

1. M. You and A. K. C. Wong, “An algorithm for graph optimal isomorphism,” in Proc. 7th. Int. Conf. onPatt. Recogn., Montreal, Canada, 1984, pp. 316–319.
2. W. H. Tsai and K. S. Fu, “Error-correcting isomorphism of attributed relational graphs for pattern analysis,” IEEE Trans. Syst. Man Cybern., vol. SMC-9, no. 12, pp. 757–768, Dec. 1979.
3. D. E. Ghahraman, A. K. C. Wong, and T. Au, “Graph monomorphism algorithms,” IEEE Trans. Syst. Man Cybem., vol. SMC-10, no. 4, pp. 189–196, Ap. 1980.
4. F. A. Akinniyi, A. K. C. Wong, and D. A. Stacey, “A new algorithm for graph monomorphism based on the projections of the product graph,” IEEE Trans. Syst. Man Cybern., vol. SMC-16, no. 5, pp. 740–751, Sept./Oct. 1986.
5. J. R. Ullmann, “An algorithm for subgraph isomorphism,” J. ACM, vol. 23, no. 1, pp. 31–42, 1976.
6. J. K. Cheng and T. S. Huang, “A subgraph isomorphism algorithm using resolution,” Patt. Recogn., vol. 13, no. 5, pp. 371–379, 1981.
7. D. E. Ghahraman, A. K. C. Wong, and T. Au, “Graph optimal monomorphism algorithm,” IEEE Trans. Syst. Man Cybern., vol. SMC-10, no. 4, pp. 181–188, Apr. 1980.
8. L. G. Shapiro and R. M. Haralick, “Structural descriptions and inexact matching,” IEEE Trans. Pattern Analy. Machine Intell., vol. PAMI-3, no. 5, pp. 504–519, Sept. 1981.
9. W. H. Tsai and K. S. Fu, “Subgraph error-correcting isomorphism for syntactic pattern recognition,” IEEE Trans. Syst. Man Cybern., vol. SMC-13, no. 1, pp. 48–62, Jan./Feb. 1983.
10. M. A. Eshera and K. S. Fu, “An image understanding system using attributed symbolic representation and inexact graph-matching,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 5, pp. 604–617, Sept. 1986.
11. A. K. C. Wong and F. A. Akinniyi, “A net based algorithm for largest common subgraph isomorphism,” Proc. 1983 Int. Conf. on Systems, Man, and Cybernetics, pp. 197–201.
12. D. A. Stacey and A. K. C. Wong, “A largest common subgraph isomorphism algorithm for attributed graphs,” submitted to IEEE Trans. Syst. Man Cybern. for publication, 1988.
13. M. You and A. K. C. Wong, “On distance of attributed graphs and random graphs,” Proc. 1983 Int. Conf. on Systems, Man, and Cybernetics, pp. 632–636.
14. ——, “Random graphs and their distance measure,” Proc. 1982 Int. Conf. on Cybernetics and Society, pp. 467–471.
15. A. K. C. Wong and M. You, “Entropy and distance measures of random graphs,” Proc. 1983 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, pp. 371–376.
16. ——, “Entropy and distance of random graphs with application to structural pattern recognition,” IEEE Trans. Pattern Analy. Machine Intell., vol. PAMI-7, no. 5, pp. 599–609, Sept. 1985.
17. A. K. C. Wong, “Structural pattern recognition: A random graph approach,” in NATO ASI Series, Vol. F30, Pattern Recognition Theory and Applications, P. A. Devijver and J. Kittler, Eds. Berlin, Heidelberg: Springer-Verlag, 1987, pp. 323–345.
18. A. K. C. Wong, J. Constant, and M. You, “Random graphs,” Syntactic and Structural Pattern Recognition — Fundamentals, Advances, and Applications, H. Bunke and A. Sanfeliu, Eds. New Jersey: World Scientific, 1989.
19. J. Stroud, Airports of The World. London: Putnam & Company, 1980.