12 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DM2021★ 12 cited
On the unification of the graph edit distance and graph matching problems
Romain Raveaux
Error-tolerant graph matching gathers an important family of problems. These problems aim at finding correspondences between two graphs while integrating an error model. In the Gra…
cs.DS2015★ 4 cited
Graph edit distance : a new binary linear programming formulation
Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux +2
Graph edit distance (GED) is a powerful and flexible graph matching paradigm that can be used to address different tasks in structural pattern recognition, machine learning, and da…