메뉴 건너뛰기




Volumn 12, Issue 6, 1998, Pages 721-742

Error-correcting graph isomorphism using decision trees

Author keywords

Decision trees; Error correction; Graph isomorphism; Graph matching

Indexed keywords


EID: 0005700951     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001498000415     Document Type: Article
Times cited : (13)

References (13)
  • 2
    • 0021022807 scopus 로고
    • Inexact graph matching for structural pattern recognition
    • H. Bunke and G. Allerman, "Inexact graph matching for structural pattern recognition", Patt. Recogn. Lett. 1, 4 (1983) 245-253.
    • (1983) Patt. Recogn. Lett. , vol.1 , Issue.4 , pp. 245-253
    • Bunke, H.1    Allerman, G.2
  • 3
    • 0030084862 scopus 로고    scopus 로고
    • An inproved algorithm for relational distance graph matching
    • L. Cinque, D. Yasuda, L. G. Shapiro, S. Tanimoto and B. Allen, "An inproved algorithm for relational distance graph matching", Patt. Recogn. 29, 2 (1996) 349-359.
    • (1996) Patt. Recogn. , vol.29 , Issue.2 , pp. 349-359
    • Cinque, L.1    Yasuda, D.2    Shapiro, L.G.3    Tanimoto, S.4    Allen, B.5
  • 6
    • 0002248659 scopus 로고
    • Efficient error-tolerant subgraph isomorphism detection
    • eds. D. Dori and A. Bruckstein, World Scientific, Singapore
    • B. T. Messmer and H. Bunke, "Efficient error-tolerant subgraph isomorphism detection", Shape, Structure and Pattern Recognition, eds. D. Dori and A. Bruckstein, World Scientific, Singapore, 1995, pp. 231-240.
    • (1995) Shape, Structure and Pattern Recognition , pp. 231-240
    • Messmer, B.T.1    Bunke, H.2
  • 7
    • 0005751243 scopus 로고
    • Subgraph isomorphism detection in polynomial time on preprocessed model graphs
    • B. T. Messmer and H. Bunke, "Subgraph isomorphism detection in polynomial time on preprocessed model graphs", Proc. Asian Conf. Computer Vision ACCV, 1995, pp. 151-155.
    • (1995) Proc. Asian Conf. Computer Vision ACCV , pp. 151-155
    • Messmer, B.T.1    Bunke, H.2
  • 9
    • 0020752197 scopus 로고
    • A distance measure between attributed relational graphs for pattern recognition
    • A. Sanfeliu and K. S. Fu, "A distance measure between attributed relational graphs for pattern recognition", IEEE Trans. Syst. Man Cybern. 13 (1983) 353-363.
    • (1983) IEEE Trans. Syst. Man Cybern. , vol.13 , pp. 353-363
    • Sanfeliu, A.1    Fu, K.S.2
  • 11
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • J. R. Ullman, "An algorithm for subgraph isomorphism", J. Assoc. Comput. Mach. 23, 1 (1976) 31-42.
    • (1976) J. Assoc. Comput. Mach. , vol.23 , Issue.1 , pp. 31-42
    • Ullman, J.R.1
  • 12
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R. A. Wagner and M. J. Fischer, "The string-to-string correction problem", J. Assoc. Comput. Mach. 21, 1 (1974) 168-173.
    • (1974) J. Assoc. Comput. Mach. , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 13
    • 0001456636 scopus 로고
    • Three-dimensional object recognition by attributed graphs
    • eds. H. Bunke and A. Sanfeliu, World Scientific
    • E. K. Wong, "Three-dimensional object recognition by attributed graphs", Syntactic and Structural Pattern Recognition-Theory and Applications, eds. H. Bunke and A. Sanfeliu, World Scientific, 1990, pp. 381-414.
    • (1990) Syntactic and Structural Pattern Recognition-Theory and Applications , pp. 381-414
    • Wong, E.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.