Aproximated Graph edit distance

Bunch of aproximated graph edit distance algorithms.

Algorithms

Assignment Edit Distance (AED)

[1] Upper bound of order O((n_1+n_2)^3)

Hausdorff Edit Distance (HED)

[2] Lower bound of order O(n_1*n_2)

Bibliography

[1] Riesen, Kaspar, and Horst Bunke. "Approximate graph edit distance computation by means of bipartite graph matching." Image and Vision computing 27.7 (2009): 950-959.

[2] Fischer, Andreas, et al. "Approximation of graph edit distance based on Hausdorff matching." Pattern recognition 48.2 (2015): 331-343.

Authors

• Pau Riba (@priba)
• Anjan Dutta (@AnjanDutta)