Computation of graph edit distance: Reasoning about optimality and speed-up ? ??
Graph Edit Distance (GED) is the most used error-tolerant graph matching method. Bipartite graph matching algorithm (BP) is the most used algorithm to solve GED. 2 new versions of BP published that reduce the runtime but restrictions are imposed. We study how much extend these restrictions limits their applicability. Empirical validation shows new versions reduce runtime but keep recognition ratio.
error-tolerant graph matching bipartite graph matching algorithm fast bipartite square fast bipartite hungarian method jonkervolgenant solver