Login / Signup
A local branching heuristic for solving a Graph Edit Distance Problem.
Mostafa Darwiche
Donatello Conte
Romain Raveaux
Vincent T'kindt
Published in:
Comput. Oper. Res. (2019)
Keyphrases
</>
graph edit distance
combinatorial optimization
graph matching
branch and bound
dynamic programming
edit distance
image segmentation
optimal solution
string edit distance
feature selection
search algorithm
knn
shortest path
graph kernels
adjacency matrix