Login / Signup

Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks.

Benoit GaüzèreSébastien BougleuxKaspar RiesenLuc Brun
Published in: S+SSPR (2014)
Keyphrases
  • bipartite matching
  • graph edit distance
  • graph matching
  • minimum cost flow
  • maximum weight
  • edit distance
  • adjacency matrix
  • feature vectors
  • string edit distance
  • directed graph
  • bi objective