Login / Signup
Efficient parallel branch-and-bound approaches for exact graph edit distance problem.
Adel Dabah
Ibrahim Chegrane
Saïd Yahiaoui
Ahcène Bendjoudi
Nadia Nouali-Taboudjemat
Published in:
Parallel Comput. (2022)
Keyphrases
</>
branch and bound
lower bound
upper bound
branch and bound algorithm
search algorithm
graph edit distance
depth first search
optimal solution
combinatorial optimization
column generation
search space
branch and bound procedure
matching algorithm
tree search