Efficient subgraph isomorphism detection: A decomposition approach

IEEE Transactions on Knowledge and Data Engineering

Volumn 12, Issue 2, 2000, Pages 307-323

  Messmer, Bruno T ^b   Bunke, Horst ^a,b  

^a IEEE   (Switzerland)

^b UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ISOMORPHISM DETECTION; GRAPH MATCHING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; MATHEMATICAL MODELS; RESPONSE TIME (COMPUTER SYSTEMS);

DATA STRUCTURES;

EID: 0033685860     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.842269     Document Type: Article

References (42)

1. D.H. Rouvray and A.T. Balaban, "Chemical Applications of Graph Theory," Applications of Graph Theory, R.J. Wilson and L.W. Beineke, eds., Academic Press, pp. 177-221, 1979.
2. S. Bradtke and W.G. Lehnert, "Some Experiments with Case-Based Search," Proc. Seventh Nat'l Conf. Artificial Intelligence, vol. 1, pp. 133-138, 1988.
3. J. Poole, "Similarity in Legal Case-Based Reasoning as Degree of Matching in Conceptual Graphs," Preproc. First European Workshop Case-Based Reasoning, MM. Richter, S. Wess, K.-D. Althoff, and F. Maurer, eels., pp. 54-58, 1993.
4. H. Ehrig, "Introduction to Graph Grammers with Applications to Semantic Networks," Computers and Math. with Applications, vol. 23, pp. 557-572, Sept. 1992.
5. B. Bhanu and J.C. Ming, "TRIPLE: A Multistrategy Machine Learning Approach to Target Recognition," Proc. Image Understanding Workshop, pp. 537-547, 1988.
6. D.H. Fisher, "Knowledge Acquisition via Incremental Conceptual Clustering," Readings in Machine Learning, J.W. Shavlik and T.G. Dietterich, eds., Morgan Kaufmann, pp. 267-283, 1990.
7. D.J. Cook and L.B. Holder, "Substructure Discovery Using Minimum Description Length and Background Knowledge," J. Artificial Intelligence Research, pp. 231-255, 1994.
8. B.T. Messmer and H. Bunke, "Automatic Learning and Recognition of Graphical Symbols in Engineering Drawings," Proc. Int'l Workshop Graphics Recognition, pp. 33-43, 1995.
9. S.W. Lu, Y. Ren, and C.Y. Suen, "Hierarchical Attributed Graph Representation and Recognition of Handwritten Chinese Characters," Pattern Recognition, vol. 24, pp. 617-632, 1991.
10. H. Bunke, "Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 6, pp. 574-582, 1982.
11. S.W. Lee, J.H. Kim, and F.C.A. Groen, "Translation- Rotation- and Scale Invariant Recognition of Hand-Drawn Symbols in Schematic Diagrams," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 4, no. 1, pp. 1-15, 1990.
12. S.W. Lee and J.H. Kim, "Attributed Stroke Graph Matching for Seal Imprint Verification," Pattern Recognition Letters, vol. 9, pp. 137-145, Feb. 1989.
13. A. Pearce, T. Caelli, and W.F. Bischof, "Rulegraphs for Graph Matching in Pattern Recognition," Pattern Recognition, vol. 27, no. 9, pp. 1,231-1,246, 1994.
14. E. Gmuer and H. Bunke, "3-D Object Recognition Based on Subgraph Matching in Polynomial Time," Structural Pattern Analysis, R. Mohr, T. Pavlidis, and A. Sanfeliu, eds., World Scientific, pp. 131-147, 1990.
15. R. Horaud and T. Skordas, "Structural Matching for Stereo Vision," Proc. Ninth Int'l Conf. Pattern Recognition, pp. 439-445, 1988.
16. J.K. Cheng and T.S. Huang, "Image Recognition by Matching Relational Structures," IEEE PRIP, pp. 542-547, 1981.
17. A.W. Wong, S.W. Lu, and M. Rioux, "Recognition and Shape Synthesis of 3-D Objects Based on Attributed Graphs," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 279-290, Mar. 1989.
18. C.J. Cho and J.J. Kim, "Recognizing 3-D Objects by Forward Checking Constrained Tree Search," Pattern Recognition Letters, vol. 13, no. 8, pp. 587-597, 1992.
19. E.K. Wong, "Model Matching in Robot Vision by Subgraph Isomorphism," Pattern Recognition, vol. 25, no. 3, pp. 287-304, 1992.
20. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
21. J.R. Ullman, "An Algorithm for Subgraph Isomorphism," J. of the Assoc. for Computing Machinery, vol. 23, no. 1, pp. 31-42, 1976.
22. R.M. Haralick and G.L. Elliot, "Increasing Tree Search Efficiency for Constraint Satisfaction Problems," Artificial Intelligence, vol. 14, pp. 263-313, 1980.
23. W.Y. Kim and A.C. Kak, "3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation, IEEE Trans. Pattern Analysis and Machine Intelligence," vol. 13, pp. 224-251, 1991.
24. B. Falkenhainer, K.D. Forbus, and D. Gentner, "The Structure-Mapping Engine: Algorithms and Examples," Artificial Intelligence, vol. 41, pp. 1-63, 1990.
25. S.H. Myaeng and A. Lopez-Lopez, "Conceptual Graph Matching: A Flexible Algorithm and Experiments," J. Experimental and Theoretical Artificial Intelligence, vol. 4, pp. 107-126, Apr. 1992.
26. R.E. Blake, "Partitioning Graph Matching with Constraints, Pattern Recognition," vol. 27, no. 3, pp. 439-446, 1994.
27. P. Kuner and B. Ueberreiter, "Pattern Recognition by Graph Matching-Combinatorial versus Continous Optimization," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 2, no. 3, pp. 527-542, 1988.
28. L. Herault, R. Horaud, F. Veillon, and J.J. Niez, "Symbolic Image Matching by Simulated Annealing," Proc. British Machine Vision Conf., pp. 319-324, 1990.
29. K.A. De Jong and W.M. Spears, "Using Genetic Algorithms to Solve NP-Complete Problems," Genetic Algorithms, J.D. Schaffer, ed., Morgan Kaufmann, pp. 124-132, 1989.
30. D.E. Brown, C.L. Huntley, and A.R. Spillane, "A Parallel Genetic Heuristic for the Quadratic Assignment Problem," Genetic Algorithms, J. D. Schaffer, ed., Morgan Kaufmann, pp. 406-415, 1989.
31. G.P. Ford and J. Zhang, "A Structural Graph Matching Approach to Image Understanding," SPIE Intelligent Robots and Computer Vision X: Algorithms and Techniques, vol. 1,607, pp. 559-569, 1991.
32. W.J. Christmas, J. Kittler, and M. Petrou, "Structural Matching in Computer Vision Using Probabilistic Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, Aug. 1995.
33. L.G. Shapiro and R.M. Haralick, "Organization of Relational Models for Scene Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, pp. 595-602, 1982.
34. D.S. Seong, H.S. Kim, and K.H. Park, "Incremental Clustering of Attributed Graphs," IEEE Trans. System, Man, and Cybernetics, vol. 23, no. 5, pp. 1,399-1,411, 1993.
35. H. Sossa and R. Horaud, "Model Indexing: The Graph-Hashing Approach," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 811-814, 1992.
36. J.B. Burns and E.M. Riseman, "Matching Complex Images to Multiple 3D Objects Using View Description Networks," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 328-334, 1992.
37. K. Sengupta and K.L. Boyer, "Organizing Large Structural Modelbases," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 4, Apr. 1995.
38. S. Paris, "Structural Recognition Using an Index," Proc. Seventh Int'l Conf. Image Analysis and Processing: Progress in Image Analysis and Processing III, S. Impedovo, ed., pp. 258-265, 1993.
39. R. Levinson, "Pattern Associativity and the Retrieval of Semantic Networks," Computers and Math. with Applications, vol. 23, pp. 573-600, Sept. 1992.
40. C.L. Forgy, "Rete, a Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem," Artificial Intelligence, vol. 19, pp. 17-37, 1982.
41. H.S. Lee and M.I. Schor, "Match Algorithms for Generalized Rete Networks," Artificial Intelligence, pp. 255-270, 1992.
42. M.A. Kelly and R.E. Seviora, "An Evaluation of DRETE on CUPID for OPS5 Matching," Proc. 11th Int'l Joint Conf. Artificial Intelligence, vol. 1, pp. 84-90, 1989.