메뉴 건너뛰기




Volumn 438, Issue 5, 2013, Pages 2331-2338

A new dissimilarity measure for comparing labeled graphs

Author keywords

Graph Laplacian; Labeled graph dissimilarity; Spectral graph comparison

Indexed keywords

DISSIMILARITY MEASURES; EIGEN DECOMPOSITION; EIGENVALUES; GRAPH ANALYSIS; GRAPH LAPLACIAN; GRAPH LAPLACIANS; GRAPH STRUCTURES; LABELED GRAPHS; SPECTRAL GRAPH COMPARISON; SPECTRAL GRAPH THEORY;

EID: 84872101681     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2012.10.021     Document Type: Article
Times cited : (11)

References (13)
  • 2
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • H. Bunke, and K. Shearer A graph distance metric based on the maximal common subgraph Pattern Recognit. Lett. 19 3-4 1998 255 259
    • (1998) Pattern Recognit. Lett. , vol.19 , Issue.34 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 4
    • 0021432552 scopus 로고
    • A graph distance measure for image analysis
    • M.A. Eshera, and K.S. Fu A graph distance measure for image analysis IEEE Trans. Syst. Man Cybern. 14 1984 398 407
    • (1984) IEEE Trans. Syst. Man Cybern. , vol.14 , pp. 398-407
    • Eshera, M.A.1    Fu, K.S.2
  • 5
    • 0035339250 scopus 로고    scopus 로고
    • A graph distance metric combining maximum common subgraph and minimum common supergraph
    • M.-L. Fernández, and G. Valiente A graph distance metric combining maximum common subgraph and minimum common supergraph Pattern Recognit. Lett. 22 6-7 2001 753 758
    • (2001) Pattern Recognit. Lett. , vol.22 , Issue.67 , pp. 753-758
    • Fernández, M.-L.1    Valiente, G.2
  • 6
    • 4944219668 scopus 로고    scopus 로고
    • Deriving phylogenetic tree from the similarity analysis of metabolic pathways
    • M. Heymans, and A.K. Singh Deriving phylogenetic tree from the similarity analysis of metabolic pathways Bioinformatics 26 17 2003 138 146
    • (2003) Bioinformatics , vol.26 , Issue.17 , pp. 138-146
    • Heymans, M.1    Singh, A.K.2
  • 7
    • 29144474447 scopus 로고    scopus 로고
    • Mining coherent dense subgraphs across massive biological networks for functional discovery
    • H. Hu, X. Yan, Y. Huang, J. Han, and X.J. Zhou Mining coherent dense subgraphs across massive biological networks for functional discovery Bioinformatics 21 1 2005 213 221
    • (2005) Bioinformatics , vol.21 , Issue.1 , pp. 213-221
    • Hu, H.1    Yan, X.2    Huang, Y.3    Han, J.4    Zhou, X.J.5
  • 8
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V.I. Levenshtein Binary codes capable of correcting deletions, insertions, and reversals Sov. Phys. Dokl. 10 1966 707 710
    • (1966) Sov. Phys. Dokl. , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 10
    • 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 362
    • (1983) IEEE Trans. Syst. Man Cybern. , vol.13 , pp. 353-362
    • Sanfeliu, A.1    Fu, K.S.2


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