Login / Signup

Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations.

Kaspar RiesenAndreas FischerHorst Bunke
Published in: Int. J. Pattern Recognit. Artif. Intell. (2015)
Keyphrases
  • lower and upper bounds
  • graph edit distance
  • lower bound
  • upper bound
  • graph matching
  • string edit distance
  • graph model
  • adjacency matrix
  • edit distance
  • closed form
  • bipartite graph
  • pattern recognition
  • graph kernels