The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Comparing stars: on approximating graph edit distance
Abstract
Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measures to determine similarities between graphs and has extensive applications in the fields of pattern recognition, computer vision etc. Unfortunately, the problem of graph edit distance computation is NP-Hard in general. Accordingly, in this paper we introduce three novel methods to compute the upper and lower bounds for the edit distance between two graphs in polynomial time. Applying these methods, two algorithms AppFull and AppSub are introduced to perform different kinds of graph search on graph databases. Comprehensive experimental studies are conducted on both real and synthetic datasets to examine various aspects of the methods for bounding graph edit distance. Result shows that these methods achieve good scalability in terms of both the number of graphs and the size of graphs. The effectiveness of these algorithms also confirms the usefulness of using our bounds in filtering and searching of graphs.
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
(1979) · Cited by 43,841
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
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Willett, P., Barnard, J. M., & Downs, G. M. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9800211 · Cited by 1,765
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
A graph distance metric based on the maximal common subgraph
Bunke, H., & Shearer, K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00179-7 · Cited by 754
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
Bidirectional expansion for keyword search on graph databases
Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., & Karambelkar, H. (2005) · Cited by 482
Mining molecular fragments: finding relevant substructures of molecules
Borgelt, C., & Berthold, M. R. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183885 · Cited by 442
Computational Modeling of Genetic and Biochemical Networks
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/2018.001.0001 · Cited by 439
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
Self-citationA new algorithm for error-tolerant subgraph isomorphism detection
Messmer, B., & Bunke, H. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682179 · Cited by 348
Mining coherent dense subgraphs across massive biological networks for functional discovery
Hu, H., Yan, X., Huang, Y., Han, J., & Zhou, X. J. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1049 · Cited by 333
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
Raymond, J. W. (2002) · The Computer Journal · doi:10.1093/comjnl/45.6.631 · Cited by 319
Structural matching by discrete relaxation
Wilson, R. C., & Hancock, E. R. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.601251 · Cited by 311
Closure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Similarity searching in medical image databases
Petrakis, E. G. M., & Faloutsos, A. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.599932 · Cited by 269
Graph indexing: tree + delta <= graph
Zhao, P., Yu, J. X., & Yu, P. S. (2007) · Very Large Data Bases · Cited by 260
SAGA: a subgraph matching tool for biological graphs
Tian, Y., McEachin, R. C., Santos, C., States, D. J., & Patel, J. M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl571 · Cited by 253
A linear programming approach for the weighted graph matching problem
Almohamad, H. A., & Duffuaa, S. O. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.211474 · Cited by 241
Fast and practical indexing and querying of very large graphs
Trißl, S., & Leser, U. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247573 · Cited by 233
Efficient matching and indexing of graph models in content-based retrieval
Berretti, S., Del Bimbo, A., & Vicario, E. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954600 · Cited by 225
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
A graph distance metric combining maximum common subgraph and minimum common supergraph
Fernández, M.-L., & Valiente, G. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00017-4 · Cited by 206
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
Myers, R., Wison, R. C., & Hancock, E. R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862201 · Cited by 171
Similarity evaluation on tree-structured data
Yang, R., Kalnis, P., & Tung, A. K. H. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066243 · Cited by 165
Self-citationTowards graph containment search and indexing
Chen, C., Yan, X., Yu, P. S., Han, J., Zhang, D., & Gu, X. (2007) · Cited by 86
Feature-based similarity search in graph structures
Yan, X., Zhu, F., Yu, P. S., et al. (2006) · ACM Transactions on Database Systems · doi:10.1145/1189769.1189777 · Cited by 61
Trinajstić, N., Knop, J. V., Müller, W. R., et al. (1991) · Medical Entomology and Zoology · Cited by 43
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Bower, J. M., & Bolouri, H. (2004) · The MIT Press eBooks · Cited by 29
Cited by
Auto-Keras: An Efficient Neural Architecture Search System
Jin, H., Song, Q., & Hu, X. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330648 · Cited by 891
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
Stay on the Path: Instruction Fidelity in Vision-and-Language Navigation
Jain, V., Magalhaes, G., Ku, A., Vaswani, A., Ie, E., & Baldridge, J. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1181 · Cited by 165
Deep learning approaches for similarity computation: A survey
Yang, P., Wang, H., Yang, J., Qian, Z., Zhang, Y., & Lin, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3422484 · Cited by 28
Comparing Planning Domain Models Using Answer Set Programming
Chrpa, L., Dodaro, C., Maratea, M., Mochi, M., & Vallati, M. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-43619-2_16 · Cited by 2
Metadata
- Authors
- Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., & Zhou, L.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 1
- Pages
- 25-36
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2032338144
- Cited by
- 399
- References
- 32
- FWCI
- 9.53
- 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.