Graph edit distance

Known as: Ged, Tree Edit Distance 
In mathematics and computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs.The concept of graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two… (More)
  • table 1
  • table 2
Is this relevant?
2015
2015
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2014
2014
One of the major tasks in many applications in the field of document analysis is the computation of dissimilarities between two… (More)
  • figure 2
  • figure 1
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Review
2008
Review
2008
Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In approximate, or error-correcting, graph matching one considers a set of graph edit operations, and defines the edit distance… (More)
  • figure 1
Is this relevant?