Speeding up Graph Edit Distance Computation with a Bipartite Heuristic
Published on Sep 05, 20073841 Views
In the present paper we aim at speeding up the computation of exact graph edit distance. We propose to combine the standard tree search approach to graph edit distance computation with the suboptimal