On the unification of the graph edit distance and graph matching problems

03/09/2021
by   Romain Raveaux, et al.
0

Error-tolerant graph matching gathers an important family of problems. These problems aim at finding correspondences between two graphs while integrating an error model. In the Graph Edit Distance (GED) problem, the insertion/deletion of edges/nodes from one graph to another is explicitly expressed by the error model. At the opposite, the problem commonly referred to as "graph matching" does not explicitly express such operations. For decades, these two problems have split the research community in two separated parts. It resulted in the design of different solvers for the two problems. In this paper, we propose a unification of both problems thanks to a single model. We give the proof that the two problems are equivalent under a reformulation of the error models. This unification makes possible the use on both problems of existing solving methods from the two communities.

READ FULL TEXT
research
11/26/2019

Flexible graph matching and graph edit distance using answer set programming

The graph isomorphism, subgraph isomorphism, and graph edit distance pro...
research
12/30/2020

Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching

The graph is one of the most widely used mathematical structures in engi...
research
12/23/2009

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

This paper formulates a necessary and sufficient condition for a generic...
research
06/24/2019

Algorithms for deletion problems on split graphs

In the Split to Block Vertex Deletion and Split to Threshold Vertex Dele...
research
09/10/2018

Convolutional Neural Networks for Fast Approximation of Graph Edit Distance

Graph Edit Distance (GED) computation is a core operation of many widely...
research
12/02/2019

On the query complexity of estimating the distance to hereditary graph properties

Given a family of graphs F, we prove that the normalized edit distance o...
research
03/08/2015

TED: A Tolerant Edit Distance for Segmentation Evaluation

In this paper, we present a novel error measure to compare a segmentatio...

Please sign up or login with your details

Forgot password? Click here to reset