The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Approximate graph edit distance computation by means of bipartite graph matching
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
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 10,358
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
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
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
BRENDA, the enzyme database: updates and major new developments
Schomburg, I. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh081 · Cited by 953
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
Cited by
Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection
Xu, X., Liu, C., Feng, Q., Yin, H., Song, L., & Song, D. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134018 · Cited by 530
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
Graph-based root cause analysis for service-oriented and microservice architectures
Brandón, Á., Solé, M., Huélamo, A., Solans, D., Pérez, M. S., & Muntés-Mulero, V. (2020) · Journal of Systems and Software · doi:10.1016/j.jss.2019.110432 · Cited by 121
Decentralized Quality of Service Based System for Energy Trading Among Electric Vehicles
Al-Obaidi, A. A., & Farag, H. E. Z. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3058514 · Cited by 35
Metadata
- Authors
- Riesen, K., & Bunke, H.
- Venue
- Image and Vision Computing
- Publisher
- Elsevier BV
- Published
- 2009-06
- Volume
- 27
- Issue
- 7
- Pages
- 950-959
- ISSN
- 0262-8856 (ISSN-L)
- OpenAlex
- W2170607286
- Cited by
- 651
- References
- 25
- FWCI
- 30.07
- 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: Approximate graph edit distance computation by means of bipartite graph matching. https://app.cochat.ai/papers/10.1016/j.imavis.2008.04.004
- The paper
- Riesen, K., & Bunke, H. (2009). Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing. https://doi.org/10.1016/j.imavis.2008.04.004
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.