The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
Abstract
A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the exact degree and composition of similarity. The proposed MCES algorithm is based on a maximum clique formulation of the problem and is a significant improvement over other published algorithms. It presents new approaches to both lower and upper bounding as well as vertex selection.
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
Diestel, R. (1997) · Cited by 5,082
Willett, P., Barnard, J. M., & Downs, G. M. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9800211 · Cited by 1,765
Trinajstic, N. (2018) · Routledge eBooks · doi:10.1201/9781315139111 · Cited by 1,491
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
A distance measure between attributed relational graphs for pattern recognition
Sanfeliu, A., & Fu, K.-S. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313167 · Cited by 999
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
Brown, R. D., & Martin, Y. C. (1996) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9501047 · Cited by 625
A fast algorithm for the maximum clique problem
Östergård, P. R. J. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00290-6 · Cited by 590
Neighborhood Behavior: A Useful Concept for Validation of “Molecular Diversity” Descriptors
Patterson, D. E., Cramer, R. D., Ferguson, A. M., Clark, R. D., & Weinberger, L. E. (1996) · Journal of Medicinal Chemistry · doi:10.1021/jm960290n · Cited by 509
Matching hierarchical structures using association graphs
Pelillo, M., Siddiqi, K., & Zucker, S. W. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.809105 · Cited by 394
Cited by
Hattori, M., Okuno, Y., Goto, S., & Kanehisa, M. (2003) · Journal of the American Chemical Society · doi:10.1021/ja036030u · Cited by 484
Comparing stars: on approximating graph edit distance
Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., & Zhou, L. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687631 · Cited by 399
Geppert, H., Vogt, M., & Bajorath, J. (2010) · Journal of Chemical Information and Modeling · doi:10.1021/ci900419k · Cited by 327
Substructure similarity search in graph databases
Yan, X., Yu, P. S., & Han, J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066244 · Cited by 314
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
- Raymond, J. W.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-06-01
- Volume
- 45
- Issue
- 6
- Pages
- 631-644
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2096725584
- Cited by
- 319
- References
- 21
- FWCI
- 7.11
- 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: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs. https://app.cochat.ai/papers/10.1093/comjnl/45.6.631
- The paper
- Raymond, J. W. (2002). RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs. The Computer Journal. https://doi.org/10.1093/comjnl/45.6.631
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.