The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Backtrack search algorithms and the maximal common subgraph problem
Abstract
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 place.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
Efficient Heuristics for Maximum Common Substructure Search
Englert, P., & Kovács, P. (2015) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5b00036 · Cited by 36
Metadata
- Authors
- McGregor, J. J.
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 1982-01
- Volume
- 12
- Issue
- 1
- Pages
- 23-34
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W1974032838
- Cited by
- 297
- References
- 1
- FWCI
- 0.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Backtrack search algorithms and the maximal common subgraph problem. https://app.cochat.ai/papers/10.1002/spe.4380120103
- The paper
- McGregor, J. J. (1982). Backtrack search algorithms and the maximal common subgraph problem. Software: Practice and Experience. https://doi.org/10.1002/spe.4380120103
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
