论文信息 - A subgraph isomorphism algorithm using resolution

A subgraph isomorphism algorithm using resolution

Abstract An efficient algorithm for subgraph isomorphism is presented. It combines tree search with relaxation by using resolution. Bitwise parallelism, which is an important factor in speed, is achieved during the resolution process even though a sequential computer is used. The algorithm can be easily modified to apply to multi-relation labeled graphs, attributed graphs and some higher order structures such as arrangements.

Thomas S. Huang | J. K. Cheng

[1] Douglas C. Schmidt,et al. A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.

[2] D. Corneil,et al. An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[3] Edward H. Sussenguth. A Graph-Theoretic Algorithm for Matching Chemical Structures. , 1965 .

[4] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[5] Azriel Rosenfeld,et al. Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[6] Alfs T. Berztiss,et al. A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.