An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric combining maximum common subgraph and minimum common supergraph
Pattern Recognition Letters
A Graph-Based Method for Face Identification from a Single 2D Line Drawing
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Alignment between Two RNA Structures
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Efficient Alignment and Correspondence Using Edit Distance
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
A POCS-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polynomial-Time Metrics for Attributed Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Measuring the Similarity of Geometric Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
Graph classification by means of Lipschitz embedding
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Bipartite graph matching for computing the edit distance of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A quadratic programming approach to the graph edit distance problem
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A tool for fast indexing and querying of graphs
Proceedings of the 20th international conference companion on World wide web
Improved call graph comparison using simulated annealing
Proceedings of the 2011 ACM Symposium on Applied Computing
A generic framework for median graph computation based on a recursive embedding approach
Computer Vision and Image Understanding
Speeding up graph edit distance computation through fast bipartite matching
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Malware classification based on call graph clustering
Journal in Computer Virology
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
On the relation between the common labelling and the median graph
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Graph similarity search with edit distance constraint in large graph databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Towards the estimation of feature-based semantic similarity using multiple ontologies
Knowledge-Based Systems
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.14 |
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.