On the Edit Distance from K2, t-Free Graphs.
Ryan R. MartinTracy McKayPublished in: J. Graph Theory (2014)
Keyphrases
- edit distance
- graph matching
- graph edit distance
- subgraph isomorphism
- tree structured data
- edit operations
- string edit distance
- adjacency matrix
- similarity measure
- approximate string matching
- string matching
- levenshtein distance
- graph kernels
- string similarity
- pairwise
- object recognition
- distance computation
- distance measure
- matching algorithm
- directed graph
- approximate matching
- dynamic programming
- distance function
- tree edit distance
- image matching
- pattern recognition
- similarity join
- graph model
- dissimilarity measure
- weighted graph
- computer vision