The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A (sub)graph isomorphism algorithm for matching large graphs
Abstract
We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs.
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
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 6×
“The process of finding the mapping function can be suitably described by means of a State Space Representation (SSR) [18].”
MethodInfluential
Cited by
Martinize2 and Vermouth provide a unified framework for molecular topology generation
Kroon, P. C., Grünewald, F., Barnoud, J., van Tilburg, M., Brasnett, C., Souza, P. C., Wassenaar, T. A., & Marrink, S. J. (2025) · eLife · doi:10.7554/elife.90627 · Cited by 124
Tannu, S. S., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358257 · Cited by 100
McCreesh, C., Prosser, P., & Trimble, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-51372-6_19 · Cited by 57
Panahandeh, M., Hamou-Lhadj, A., Hamdaqa, M., & Miller, J. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111917 · Cited by 49
Crafting Personalized Agents through Retrieval-Augmented Generation on Editable Memory Graphs
Wang, Z., Li, Z., Jiang, Z., Tu, D., & Shi, W. (2024) · Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2024.emnlp-main.281 · Cited by 12
Metadata
- Authors
- Cordella, L. P., Foggia, P., Sansone, C., & Vento, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-10
- Volume
- 26
- Issue
- 10
- Pages
- 1367-1372
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2147405597
- Cited by
- 1,477
- References
- 1
- FWCI
- 12.57
- 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 (sub)graph isomorphism algorithm for matching large graphs. https://app.cochat.ai/papers/10.1109/tpami.2004.75
- The paper
- Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004). A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2004.75
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.
