Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment

Andreas Fischer 0002, Kaspar Riesen, Horst Bunke. Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment. Pattern Recognition Letters, 87:55-62, 2017. [doi]

@article{FischerRB17,
  title = {Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment},
  author = {Andreas Fischer 0002 and Kaspar Riesen and Horst Bunke},
  year = {2017},
  doi = {10.1016/j.patrec.2016.06.014},
  url = {http://dx.doi.org/10.1016/j.patrec.2016.06.014},
  researchr = {https://researchr.org/publication/FischerRB17},
  cites = {0},
  citedby = {0},
  journal = {Pattern Recognition Letters},
  volume = {87},
  pages = {55-62},
}