메뉴 건너뛰기




Volumn 9, Issue 1, 2001, Pages 173-182

Graph matching by relaxation of fuzzy assignments

Author keywords

Graph isomorphism; Graph matching; Inexact graph matching; Subgraph matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA;

EID: 0035245195     PISSN: 10636706     EISSN: None     Source Type: Journal    
DOI: 10.1109/91.917123     Document Type: Article
Times cited : (34)

References (25)
  • 3
    • 4243280955 scopus 로고    scopus 로고
    • Parallel algorithms for labeled graph matching
    • Ph.D. dissertation, Colorado School of Mines, Golden, CO
    • (1998)
    • Abdulrahim, M.A.1
  • 9
    • 0033570815 scopus 로고    scopus 로고
    • Replicator equations, maximal cliques, and graph isomorphism
    • (1999) Neural Computat. , vol.11 , Issue.8 , pp. 1933-1955
    • Pelillo, M.1


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