Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching.

Stefan Fankhauser Kaspar Riesen Horst Bunke

Published in: GbRPR (2011)

Keyphrases

bipartite matching
graph edit distance
graph matching
edit distance
minimum cost flow
string edit distance
maximum weight
image segmentation
pattern recognition
computational complexity
special case
graph kernels