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.
2014
2014
Drawing on interviews, participant observation, and census and economic data, this article examines the value of the GED for… 
2010
2010
A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and… 
2008
2008
The stochastic Hopf bifurcation of multi-degree-of-freedom (MDOF) quasi-integrable Hamiltonian systems with time-delayed feedback… 
2004
2004
In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance… 
Highly Cited
2004
Highly Cited
2004
Ei~leitu~g," alas Lokalisatio~csproblem Der Menschengeist will seine Umwelt ordnen. Jedes Ding, das sieh nach Zweckbestimmung… 
2002
2002
Sequence nearest neighbors problemc an be defined as follows. Given a database D of n sequences, preprocess D so that given any… 
2001
2001
This paper investigates an approach to tree edit distance problem with weighted nodes. We show that any tree obtained with a… 
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…