Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition

IEEE Transactions on Systems, Man and Cybernetics

Volumn SMC-13, Issue 1, 1983, Pages 48-62

  Tsai, Wen Hsiang ^a   Fu, King Sun ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

PATTERN RECOGNITION;

EID: 0020497981     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/TSMC.1983.6313029     Document Type: Article

References (21)

1. W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-9, no. 12, Dec. 1979.
2. W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern classification,” Tech. Rep. TR-EE 79-3, Purdue Univ., Lafayette, IN, Jan. 1979.
3. N. J. Nilsson, Problem Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971.
4. J. R. Ullman, “An algorithm for subgraph isomorphism,” J. Ass. Comput. Mach., vol. 23, no. 1, Jan. 1976.
5. S. H. Unger, “GIT–A heuristic program for testing pairs of directed line graphs for isomorphism,” Commun. Ass. Comput. Mach., vol. 7, no. 1, Jan. 1964.
6. D. G. Cornell and C. C. Gotlieb, “An efficient algorithm for graph isomorphism,” J. Ass. Comput. Mach., vol. 17, no. 1, Jan. 1970.
7. A. T. Berztiss, “A backtrack procedure for isomorphism of directed graphs,” J. Ass. Comput. Mach., vol. 20, no. 3, July 1973.
8. E. H. Sussenguth, Jr., “A graph-theoretic algorithm for matching chemical structures,” J. Chemical Documentation, vol. 5, pp. 36-44, 1965.
9. O. Firschein and M. A. Fischler, “A study in descriptive representation of pictorial data,” in Proc. Int. Joint Conf. on AI, Imperial College, London, pp. 258-269, 1971.
10. C. Nugent et al., “An experimental comparison of techniques for the assignment of facilities to locations,” Opl. Res. Q., vol. 16, pp. 150-173, 1968.
11. A. Ginzberg, Algebraic Theory of Automata. New York: Academic, 1968.
12. L. G. Shapiro and R. M. Haralick, “Structural descriptions and inexact matching, Tech. Rep. CS-79011-R, Virginia Polytech. Inst. and State Univ., Blacksburg VA., Nov. 1979.
13. L. Kitchen, “Relaxation applied to matching quantitative relational structures,” IEEE Trans. Syst., Man, Cybern., vol. SMC-10, no. 2, Feb. 1980.
14. D. E. Ghahraman, A. K. C. Wong, and T. Au, “Graph Optimal Monomorphism Algorithms,” IEEE Trans. Syst., Man, Cybern., vol. SMC-10, no. 4, Apr. 1980.
15. S. Y. Lu and K. S. Fu, “Stochastic error-correcting syntax analysis,” IEEE Trans. Comput., vol. C-26, no. 12, Dec. 1977.
16. W. H. Tsai and K. S. Fu, “A pattern deformational model and Bayes error-correcting recognition system,” IEEE Trans. Syst., Man, Cybern., vol. SMC-9, no. 12, 1979.
17. W. H. Tsai, “Optimal subgraph error-correcting isomorphisms for matching attributed relational graphs,” in Proc. International Computer Symposium, Taipei, Taiwan, Republic of China, Dec. 1980.
18. R. C. Read and D. G. Corneil, “The graph isomorphism disease,” J. Graph Theory, vol. 1, 1977.
19. L. Babai, P. Erdos, and S. M. Selkow, “Random graph isomorphism,” SIAM J. Comput., vol. 9, no. 3, Aug. 1980.
20. R. M. Haralick and J. S. Kartus, “Arrangements, homomorphisms, and discrete relaxations,” in Proc. IEEE Conf. on Pattern Recog. and Image Processing, Chicago, IL, May 1978.
21. T. Pavlidis, Structural Pattern Recognition. New York: Springer, 1977.