Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 206

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A graph distance metric combining maximum common subgraph and minimum common supergraph

Open access
Fernández, Mirtha-Lina, Valiente, Gabriel · 2001 · Pattern Recognition Letters

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0167-8655(01)00017-4

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

  • A graduated assignment algorithm for graph matching

    Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090 · cited 1×

    “…supergraph and hence under an appropriate cost function, any algorithm that implements error-correcting graph matching (Bunke and Allermann, 1983; Gold and Rangarajan, 1996; Messmer and Bunke, 1998; Shapiro and Haralick, 1981) can be used for the computation of both the maximum common subgraph…”
    Method

Show all 1 references

Cited by

See all 206

Metadata

Authors
Fernández, M.-L., & Valiente, G.
Venue
Pattern Recognition Letters
Publisher
Elsevier BV
Published
2001-05
Volume
22
Issue
6-7
Pages
753-758
ISSN
0167-8655 (ISSN-L)
OpenAlex
W2071910845
Cited by
206
References
1
FWCI
8.47
Type
journal article
Language
en
Open access
green

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 combining maximum common subgraph and minimum common supergraph. https://app.cochat.ai/papers/10.1016/s0167-8655(01)00017-4
The paper
Fernández, M.-L., & Valiente, G. (2001). A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters. https://doi.org/10.1016/s0167-8655(01)00017-4

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.