A local branching heuristic for solving a graph edit distance problem

DOI10.1016/J.COR.2018.02.002MaRDI QIDQ1734846zbMATH OpenOpenAlexFDO

Authors Mostafa Darwiche, Donatello Conte, Romain Raveaux, 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 edit distancegraph matchinglocal branching heuristic

Mathematics Subject Classification ID

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

Recommendations

• The edit distance in graphs: methods, results, and generalizations
• On the editing distance of graphs
• A Quadratic Programming Approach to the Graph Edit Distance Problem
• A survey of graph edit distance
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Improving bipartite graph edit distance approximation using various search strategies
• Improved Graph Edit Distance Approximation with Simulated Annealing

Cites work

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

Cited in

(3)

• Fast similarity search for graphs by edit distance
• Distinguishing Local and Global Edits for Their Simultaneous Propagation in a Uniform Framework
• Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734846)