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.
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.
Integrity signals
Registry
Cites
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.
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
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,807
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
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
Robust analysis of feature spaces: color image segmentation
Comaniciu, D., & Meer, P. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1997.609410 · Cited by 683
Isomorphism of graphs of bounded valence can be tested in polynomial time
Luks, E. M. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90009-5 · Cited by 645
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Bourgeois, F., & Lassalle, J.-C. (1971) · Communications of the ACM · doi:10.1145/362919.362945 · Cited by 501
Inexact graph matching for structural pattern recognition
Bunke, H., & Allermann, G. (1983) · Pattern Recognition Letters · doi:10.1016/0167-8655(83)90033-8 · Cited by 487
Self-citationClassification and uses of finger prints
Henry, E. R. (1928) · Cited by 414
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
Hopcroft, J. E., & Wong, J. K. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803896 · Cited by 344
Linear time algorithm for isomorphism of planar graphs.
Hopcroft, J. E., & Wong, J. K. (1974) · Cited by 224
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance
Neuhaus, M., Riesen, K., & Bunke, H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11815921_17 · Cited by 213
Self-citationGraph edit distance from spectral seriation
Robles-Kelly, A., & Hancock, E. R. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.56 · Cited by 200
A graph distance measure for image analysis
Eshera, M. A., & Fu, K.-S. (1984) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1984.6313232 · Cited by 185
A binary linear programming formulation of the graph edit distance
Justice, D., & Hero, A. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.152 · Cited by 184
Edit distance-based kernel functions for structural pattern classification
Neuhaus, M., & Bunke, H. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.04.012 · Cited by 179
Self-citationBipartite Graph Matching for Computing the Edit Distance of Graphs
Riesen, K., Neuhaus, M., & Horst Bunke, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72903-7_1 · Cited by 137
Self-citationGraph Embedding in Vector Spaces by Means of Prototype Selection
Riesen, K., Neuhaus, M., & Horst Bunke, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72903-7_35 · Cited by 135
Self-citationTakeo Kanade, A., Jain, A. K., & Ratha, N. (2005) · Cited by 14
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
Group Role Assignment via a Kuhn–Munkres Algorithm-Based Solution
Zhu, H., Zhou, M., & Alkins, R. (2012) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2170414 · Cited by 341
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
FOGGIA, P., PERCANNELLA, G., & VENTO, M. (2014) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001414500013 · Cited by 337
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
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
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.