메뉴 건너뛰기




Volumn 11, Issue 1, 2007, Pages 99-143

Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; OPTIMIZATION; PATTERN MATCHING; SIGNAL DETECTION;

EID: 42149142497     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00139     Document Type: Article
Times cited : (76)

References (39)
  • 1
    • 22444455831 scopus 로고    scopus 로고
    • A graph isomorphism algorithm for object recognition
    • M. Abdulrahim and M. Misra. A graph isomorphism algorithm for object recognition. Pattern Analysis and Applications, 1(3):189-201, 1998.
    • (1998) Pattern Analysis and Applications , vol.1 , Issue.3 , pp. 189-201
    • Abdulrahim, M.1    Misra, M.2
  • 2
    • 0022808049 scopus 로고    scopus 로고
    • E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Computing, 15(4), 1986.
    • E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Computing, 15(4), 1986.
  • 5
    • 0001296418 scopus 로고
    • Finding all the cliques in an undirected graph
    • C. Bron and J. Kerbosch. Finding all the cliques in an undirected graph. Communication of the ACM, 16:189-201, 1973.
    • (1973) Communication of the ACM , vol.16 , pp. 189-201
    • Bron, C.1    Kerbosch, J.2
  • 7
    • 0043283912 scopus 로고    scopus 로고
    • On the minimum common supergraph of two graphs
    • H. Bunke, X. Jiang, and A. Kandel. On the minimum common supergraph of two graphs. Computing, 65(1):13-25, 2000.
    • (2000) Computing , vol.65 , Issue.1 , pp. 13-25
    • Bunke, H.1    Jiang, X.2    Kandel, A.3
  • 8
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • H. Bunke and K.Sharer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3):255-259, 1998.
    • (1998) Pattern Recognition Letters , vol.19 , Issue.3 , pp. 255-259
    • Bunke, H.1    Sharer, K.2
  • 9
    • 77950069437 scopus 로고    scopus 로고
    • H. Bunke and B. Messmer. Efficient Attributed Graph Matching and its Application to Image Analysis, 974 of Lecture Notes In Computer Science, pages 45-55. Springer-Verlag, proceedings of the 8th international conference on image analysis and processing edition, 1995.
    • H. Bunke and B. Messmer. Efficient Attributed Graph Matching and its Application to Image Analysis, volume 974 of Lecture Notes In Computer Science, pages 45-55. Springer-Verlag, proceedings of the 8th international conference on image analysis and processing edition, 1995.
  • 11
    • 0032663728 scopus 로고    scopus 로고
    • A minimal line property preserving representation for line images
    • M. Burge and W. G. Kropatsch. A minimal line property preserving representation for line images. Computing, 62(4):355-368, 1999.
    • (1999) Computing , vol.62 , Issue.4 , pp. 355-368
    • Burge, M.1    Kropatsch, W.G.2
  • 13
    • 85036924907 scopus 로고    scopus 로고
    • A. Chianese, L. Cordella, M. D. Santo, and M. Vento. Classifying Character Shapes, pages 155-164. Visual Form: Analysis and Recognition. Plenum Press, New York, proceedings of the 8th international conference on image analysis and processing edition, 1992.
    • A. Chianese, L. Cordella, M. D. Santo, and M. Vento. Classifying Character Shapes, pages 155-164. Visual Form: Analysis and Recognition. Plenum Press, New York, proceedings of the 8th international conference on image analysis and processing edition, 1992.
  • 15
    • 0000253451 scopus 로고
    • Molecular structure comparison program for the identification of maximal common substructures
    • M. M. Cone, R. Venkataraghven, and F. W. McLafferty. Molecular structure comparison program for the identification of maximal common substructures. Journal of the American Chemistry Socitey, 99(23):7668-7671, 1977.
    • (1977) Journal of the American Chemistry Socitey , vol.99 , Issue.23 , pp. 7668-7671
    • Cone, M.M.1    Venkataraghven, R.2    McLafferty, F.W.3
  • 21
    • 38249014153 scopus 로고
    • Introduction to graph grammars with applications to semantic networks
    • H. Ehrig. Introduction to graph grammars with applications to semantic networks. Computers & Mathematics with Applications, 23:557-572, 1992.
    • (1992) Computers & Mathematics with Applications , vol.23 , pp. 557-572
    • Ehrig, H.1
  • 27
    • 51249191195 scopus 로고
    • A note on the derivation of maximal common subgraphs of two directed or undirected graphs
    • G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-354, 1972.
    • (1972) Calcolo , vol.9 , pp. 341-354
    • Levi, G.1
  • 29
    • 0025904109 scopus 로고
    • Hierarchical attributed graph representation and recognition of handwritten Chinese characters
    • S. Lu, Y. Ren, and C. Suen. Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition, 24:617-632, 1991.
    • (1991) Pattern Recognition , vol.24 , pp. 617-632
    • Lu, S.1    Ren, Y.2    Suen, C.3
  • 30
    • 0020166327 scopus 로고
    • Isomorphism of graphs of bounded valence can be tested in polynomial time
    • E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, pages 42-65, 1982.
    • (1982) Journal of Computer System Science , pp. 42-65
    • Luks, E.M.1
  • 31
    • 0011423023 scopus 로고
    • Sample graphs for isomorphism testing
    • R. Mathon. Sample graphs for isomorphism testing. Congressus Numerantium, 21:499-517, 1978.
    • (1978) Congressus Numerantium , vol.21 , pp. 499-517
    • Mathon, R.1
  • 32
    • 0019909679 scopus 로고
    • Backtrack search algorithms and the maximal common subgraph problem
    • J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12:23-34, 1982.
    • (1982) Software Practice and Experience , vol.12 , pp. 23-34
    • McGregor, J.1
  • 37
    • 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 Transaction on Systems, Man and Cybernetics, 13:353-362, 1983.
    • (1983) IEEE Transaction on Systems, Man and Cybernetics , vol.13 , pp. 353-362
    • Sanfeliu, A.1    Fu, K.2


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