Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
International Workshop on Graph-Based Representations in Pattern Recognition. GbRPR 2017: Graph-Based Representations in Pattern… 
2016
2016
Graph similarity is a basic and essential operation in many applications. In this paper, we are interested in computing graph… 
Review
2013
Review
2013
Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit… 
Highly Cited
2011
Highly Cited
2011
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing objects. The main… 
2007
2007
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit… 
2003
2003
We are concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing… 
Highly Cited
2002
Highly Cited
2002
XML documents on the web are often found without DTDs, particularly when these documents have been created from legacy HTML. Yet… 
Highly Cited
2000
Highly Cited
2000
High cycle fatigue (HCF) induced failures in aircraft gas turbine and rocket engine turbopump blades is a pervasive problem… 
Highly Cited
2000
Highly Cited
2000
This paper articulates the necessity of emphasizing the absolute level of environmental degradation in different countries as a… 
Highly Cited
1999
Highly Cited
1999
Investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost…