The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A graph distance metric based on the maximal common subgraph
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
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Iconic Indexing by 2-D Strings
Chang, S.-K., Shi, Q., & Yan, C.-W. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767923 · Cited by 597
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
On a relation between graph edit distance and maximum common subgraph
Bunke, H. (1997) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00060-3 · Cited by 530
Self-citationStructural matching in computer vision using probabilistic relaxation
Christmas, W. J., Kittler, J., & Petrou, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400565 · Cited by 495
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 453
Backtrack search algorithms and the maximal common subgraph problem
McGregor, J. J. (1982) · Software: Practice and Experience · doi:10.1002/spe.4380120103 · Cited by 297
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
Levi, G. (1973) · Calcolo · doi:10.1007/bf02575586 · Cited by 234
Model matching in robot vision by subgraph isomorphism
Wong, E. K. (1992) · Pattern Recognition · doi:10.1016/0031-3203(92)90111-u · Cited by 82
Rulegraphs for graph matching in pattern recognition
Pearce, A. R., Caelli, T., & Bischof, W. F. (1994) · Pattern Recognition · doi:10.1016/0031-3203(94)90007-8 · Cited by 46
Cited by
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
CONTE, D., FOGGIA, P., SANSONE, C., & VENTO, M. (2004) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001404003228 · Cited by 1,370
Recognition of shapes by editing their shock graphs
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1273924 · Cited by 727
Imaging human connectomes at the macroscale
Craddock, R. C., Jbabdi, S., Yan, C.-G., Vogelstein, J. T., Castellanos, F. X., Di Martino, A., Kelly, C., Heberlein, K., Colcombe, S., & Milham, M. P. (2013) · Nature Methods · doi:10.1038/nmeth.2482 · Cited by 419
Scalable Graph-based Bug Search for Firmware Images
Feng, Q., Zhou, R., Xu, C., Cheng, Y., Testa, B., & Yin, H. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978370 · Cited by 401
SimGNN: A Neural Network Approach to Fast Graph Similarity Computation
Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., & Wang, W. (2019) · Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining · doi:10.1145/3289600.3290967 · Cited by 325
Metadata
- Authors
- Bunke, H., & Shearer, K.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 1998-03
- Volume
- 19
- Issue
- 3-4
- Pages
- 255-259
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2012459404
- Cited by
- 754
- References
- 10
- FWCI
- 5.68
- 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: A graph distance metric based on the maximal common subgraph. https://app.cochat.ai/papers/10.1016/s0167-8655(97)00179-7
- The paper
- Bunke, H., & Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters. https://doi.org/10.1016/s0167-8655(97)00179-7
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.