Login / Signup

A parallel graph edit distance algorithm.

Zeina Abu-AishehRomain RaveauxJean-Yves RamelPatrick Martineau
Published in: Expert Syst. Appl. (2018)
Keyphrases
  • optimal solution
  • dynamic programming
  • neural network
  • np hard
  • matching algorithm
  • graph edit distance
  • pairwise
  • worst case
  • clustering method
  • weighted graph
  • minimal cost