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

The DOI matches its Crossref record.

Performance evaluation of the VF graph matching algorithm

Cordella, L.P., Foggia, P., Sansone, C., Vento, M.·2003·Proceedings 10th International Conference on Image Analysis and Processing

Abstract

The paper discusses the performance of a graph matching algorithm tailored for dealing with large graphs in computer vision without using information about the topology of the graphs to be matched. The algorithm, presented in more detail in other papers (and publicly available on the WWW as VF), is now discussed with reference to its computational complexity and memory requirements. The performance analysis is carried out by theoretically characterizing the matching time and the required memory in the best and worst cases. The theoretical analysis is completed by tests on a database of graphs randomly generated. The algorithm is compared with the one proposed by Ullmann (1976): experimental results confirmed the theoretical expectations, highlighting the overall efficiency of the algorithm. Some results obtained by researchers who recently used the algorithm in application domains requiring a massive use of graph matching techniques are finally reported.

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.

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

Integrity signals

Registry

Crossref · 10.1109/iciap.1999.797762

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.

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

Cited by

See all 226

Metadata

Authors
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M.
Venue
Proceedings 10th International Conference on Image Analysis and Processing
Published
2003-01-20
Pages
1172-1177
OpenAlex
W1910918478
Cited by
226
References
0
FWCI
5.92
Type
conference paper
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: Performance evaluation of the VF graph matching algorithm. https://app.cochat.ai/papers/10.1109/iciap.1999.797762
The paper
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2003). Performance evaluation of the VF graph matching algorithm. Proceedings 10th International Conference on Image Analysis and Processing. https://doi.org/10.1109/iciap.1999.797762

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.