Backtrack search algorithms and the maximal common subgraph problem

Software: Practice and Experience

Volumn 12, Issue 1, 1982, Pages 23-34

  McGregor, James J ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Backtrack search; Maximal common subgraph; Search tree

Indexed keywords

CHEMICAL REACTIONS - ANALYSIS;

COMPUTER PROGRAMMING;

EID: 0019909679     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.4380120103     Document Type: Article

References (15)

1. Storage and retrieval of information on chemical structures by computer
2. A graph‐theoretical algorithm for matching chemical structures
3. Graph algorithms in chemical computation
4. The automatic detection of chemical reaction sites
5. Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions
6. A note on the derivation of maximal common subgraphs of two directed or undirected graphs
7. Molecular structure comparison program for the identification of maximal common substructures
8. Backtrack programming
9. Experiments with some programs that search game trees
10. Application of game tree searching techniques to sequential pattern recognition
11. An algorithm for subgraph isomorphism
12. Some techniques for recognising structures in pictures
13. Structural isomorphism of picture graphs