메뉴 건너뛰기




Volumn 15, Issue 2, 2000, Pages 867-872

Efficient algorithms for matching attributed graphs and function-described graphs

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; OBJECT RECOGNITION; PATTERN MATCHING;

EID: 34147169597     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article
Times cited : (18)

References (18)
  • 10
    • 0020752197 scopus 로고
    • A distance measure between attributed relational graphs for pattern recognition
    • A. Sanfeliu and K. Fu, "A distance measure between attributed relational graphs for pattern recognition", IEEE Transactions on Systems, Man and Cybernetics, vol. 13, pp. 353-362, 1983.
    • (1983) IEEE Transactions on Systems, Man and Cybernetics , vol.13 , pp. 353-362
    • Sanfeliu, A.1    Fu, K.2
  • 14
    • 0018732476 scopus 로고
    • Error-correcting isomorphism of attributed relational graphs for pattern analysis
    • W.H. Tsai and K.S. Fu, "Error-correcting isomorphism of attributed relational graphs for pattern analysis", IEEE Transactions on Systems, Man and Cybernetics, vol. 9, pp. 757-768, 1979.
    • (1979) IEEE Transactions on Systems, Man and Cybernetics , vol.9 , pp. 757-768
    • Tsai, W.H.1    Fu, K.S.2
  • 18
    • 84887495232 scopus 로고
    • Improved Simulated annealing, Botzmann machine and attributed graph matching
    • L. Xu and E. Oja, "Improved Simulated annealing, Botzmann machine and attributed graph matching", Lee. Notes in Comp. Sc., vol. 412, pp. 151-161, 1990.
    • (1990) Lee. Notes in Comp. Sc. , vol.412 , pp. 151-161
    • Xu, L.1    Oja, E.2


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