Accelerating Graph Similarity Search through Integer Linear Programming

Andrea D'Ascenzo, Julian Meffert, Petra Mutzel +1

The Graph Edit Distance (GED) is an important metric for measuring the similarity between two (labeled) graphs. It is defined as the minimum cost required to convert one graph into…