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.
2016
2016
The combination of web document contents, sentences and users’ comments from social networks provides a viewpoint of a web… 
2011
2011
ABS TRACT Ob jec ti ve: The ob jec ti ve of this study is to es ti ma te and eva lu a te the pre va len ce of an ti bo di es of… 
2010
2010
A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and… 
2007
2007
A large amount of new information is posted on the Web every day. We can take the example of the news portals, which keep on… 
2004
2004
In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance… 
2001
2001
This paper investigates an approach to tree edit distance problem with weighted nodes. We show that any tree obtained with a… 
Review
2001
Review
2001
The purpose of this study was to examine the relationship between self-directed learning readiness and learning styles. A cluster… 
1986
1986
AND s. K. DE DATTA~ __ ABSTRACT The effects of (NH4)zS04, urea, and urea amended with the urease inhibitor, phenyl… 
1959
1959
Das gesamte Gebiet der ,,Physiologie des HSrens" abh~ndeln zu soUen (es liegen allein fiber die Hydrodynamik und die Shmeszel]en…