메뉴 건너뛰기




Volumn 10, Issue 1, 2006, Pages 47-53

Median graph computation for graph clustering

Author keywords

[No Author keywords available]

Indexed keywords


EID: 27744512266     PISSN: 14327643     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00500-005-0464-1     Document Type: Article
Times cited : (35)

References (12)
  • 2
    • 0006916971 scopus 로고
    • Subgraph isomorphism in polynomial time
    • Technical report TR-IAM-95-003
    • Messmer B, Bunke H (1995) Subgraph isomorphism in polynomial time. Technical report TR-IAM-95-003
    • (1995)
    • Messmer, B.1    Bunke, H.2
  • 3
    • 0035481807 scopus 로고    scopus 로고
    • On median graphs: Properties, algorithms, and applications
    • Jiang X, Munger A, Bunke H (2001) On median graphs: Properties, algorithms, and applications. IEEE Trans. PAMI 23(10):1-1
    • (2001) IEEE Trans. PAMI , vol.23 , Issue.10 , pp. 1
    • Jiang, X.1    Munger, A.2    Bunke, H.3
  • 6
    • 33746055358 scopus 로고    scopus 로고
    • A new algorithm for inexact graph matching
    • 16th International Conference on Pattern Recognition, Quebec, Canada
    • Hlaoui A, Wang S (2002a) A new algorithm for inexact graph matching. In 16th International Conference on Pattern Recognition, Quebec, Canada
    • (2002)
    • Hlaoui, A.1    Wang, S.2


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