A local branching heuristic for solving a graph edit distance problem

DOI10.1016/j.cor.2018.02.002zbMath1458.68200OpenAlexW2792011156MaRDI QIDQ1734846

Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent T'kindt

Publication date: 27 March 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.002

zbMATH Keywords

graph matchinggraph edit distancelocal branching heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Fast similarity search for graphs by edit distance

Cites Work

• Local branching
• Algorithms for the Assignment and Transportation Problems
• Inexact graph matching for structural pattern recognition
• Bipartite Graph Matching for Computing the Edit Distance of Graphs

This page was built for publication: A local branching heuristic for solving a graph edit distance problem