Convex graph invariant relaxations for graph edit distance.
Utkan Onur CandoganVenkat ChandrasekaranPublished in: Math. Program. (2022)
Keyphrases
- graph edit distance
- graph matching
- adjacency matrix
- convex relaxation
- string edit distance
- edit distance
- lower bound
- graph kernels
- convex optimization
- weighted graph
- np hard
- graph representation
- bipartite graph
- convex hull
- matching algorithm
- image segmentation
- multi label
- distance function
- random walk
- subgraph isomorphism
- string similarity
- feature space
- pattern recognition