Efficient graph edit distance computation using isomorphic vertices
Author:
- 7 March 2023
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 168, 71-78
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An efficient algorithm for graph edit distance computationKnowledge-Based Systems, 2019
- Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignmentPattern Recognition Letters, 2017
- Approximate Graph Edit Distance in Quadratic TimeIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2015
- Efficient Graph Similarity Search Over Large Graph DatabasesIEEE Transactions on Knowledge and Data Engineering, 2014
- Practical graph isomorphism, IIJournal of Symbolic Computation, 2014
- A partition-based approach to structure similarity searchProceedings of the VLDB Endowment, 2013
- Comparing starsProceedings of the VLDB Endowment, 2009
- SAGA: a subgraph matching tool for biological graphsBioinformatics, 2006
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983