메뉴 건너뛰기




Volumn 1876 LNCS, Issue , 2000, Pages 277-286

Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

EID: 35248819311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44522-6_29     Document Type: Conference Paper
Times cited : (8)

References (6)
  • 3
    • 84861244241 scopus 로고    scopus 로고
    • Function-described graphs for structural pattern recognition
    • Universitat Rovira i Virgili, Tarragona, Spain
    • F. Serratosa, R. Alquézar and A. Sanfeliu, "Function- Described Graphs for structural pattern recognition", Technical report DEIM-RR-99-006, Universitat Rovira i Virgili, Tarragona, Spain, 1999.
    • (1999) Technical Report DEIM-RR-99-006
    • Serratosa, F.1    Alquézar, R.2    Sanfeliu, A.3
  • 4
    • 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
  • 5
    • 0021491949 scopus 로고
    • Entropy and distance of random graphs with application to structural pattern recognition
    • A.K.C. Wong and M. You, "Entropy and distance of random graphs with application to structural pattern recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, pp. 599-609, 1985.
    • (1985) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.7 , pp. 599-609
    • Wong, A.K.C.1    You, M.2


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