Backtrack Search Algorithms and the Maximal Common Subgraph Problem

  title={Backtrack Search Algorithms and the Maximal Common Subgraph Problem},
  author={James J. McGregor},
  journal={Softw., Pract. Exper.},
SUMMARY Backtrack algorithms are applicable to a wide variety of problems. An efficient but readable version of such an algorithm is presented and its use in the problem of finding the maximal common subgraph of two graphs is described. Techniques available in this application area for ordering and pruning the backtrack search are discussed. This algorithm has been used successfully as a component of a program for analysing chemical reactions and enumerating the bond changes which have taken… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 322 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
177 Citations
5 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 177 extracted citations

322 Citations

Citations per Year
Semantic Scholar estimates that this publication has 322 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-5 of 5 references

Use of a maximal common subgraph algorithm in the automatic identificationof theostensible bondchanges occurring in chemical reactions

  • P. Willett
  • J . Chem . If . Comp . Sci .
  • 1978

Molecular structure comparison program for the identification of maximal common substructures

  • Rengachari Venkataraghaven
  • Calcolo
  • 1972

A graph - theoretical algorithm for matching chemical structures

  • R. E. Christofferson
  • J . Chem . DOC .
  • 1965

Similar Papers

Loading similar papers…