# Graph edit distance

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- S+SSPR
- 2016

The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two… (More)

Is this relevant?

2015

2015

- ArXiv
- 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)

Is this relevant?

2014

2014

- 11th IAPR International Workshop on Document…
- 2014

One of the major tasks in many applications in the field of document analysis is the computation of dissimilarities between two… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Image Vision Comput.
- 2009

In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- PVLDB
- 2009

Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit… (More)

Is this relevant?

Review

2008

Review

2008

- Pattern Analysis and Applications
- 2008

Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Pattern Analysis and Machine…
- 2005

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for… (More)

Is this relevant?

2003

2003

- GbRPR
- 2003

This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of… (More)

Is this relevant?

1999

1999

- ICIAP
- 1999

ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Pattern Recognition Letters
- 1997

In approximate, or error-correcting, graph matching one considers a set of graph edit operations, and defines the edit distance… (More)

Is this relevant?