A subgraph isomorphism algorithm using resolution
- 31 December 1981
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 13 (5) , 371-379
- https://doi.org/10.1016/0031-3203(81)90093-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesJournal of the ACM, 1976
- Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, 1973
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964