Backtrack search algorithms and the maximal common subgraph problem
- 1 January 1982
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 12 (1) , 23-34
- https://doi.org/10.1002/spe.4380120103
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Use of a maximum common subgraph algorithm in the automatic identification of ostensible bond changes occurring in chemical reactionsJournal of Chemical Information and Computer Sciences, 1981
- The Automatic Detection of Chemical Reaction SitesJournal of Chemical Information and Computer Sciences, 1978
- Computer-aided interpretation of mass spectra. 20. Molecular structure comparison program for the identification of maximal common substructuresJournal of the American Chemical Society, 1977
- Graph Algorithms in Chemical ComputationPublished by American Chemical Society (ACS) ,1977
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- Application of game tree searching techniques to sequential pattern recognitionCommunications of the ACM, 1971
- Experiments With Some Programs That Search Game TreesJournal of the ACM, 1969
- Storage and retrieval of information on chemical structures by computerEndeavour, 1968
- Backtrack ProgrammingJournal of the ACM, 1965
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965