Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,766,903 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
A* search algorithm
APX
Cheminformatics
Computer science
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
What Is the Value of the GED?
B. Bowen
,
Kathryn Nantz
College English
2014
Corpus ID: 142123568
Drawing on interviews, participant observation, and census and economic data, this article examines the value of the GED for…
Expand
2010
2010
Metamodel Matching Based on Planar Graph Edit Distance
Konrad Voigt
,
Thomas S. Heinze
ICMT@TOOLS
2010
Corpus ID: 30550891
A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and…
Expand
2008
2008
STOCHASTIC HOPF BIFURCATION OF QUASI-INTEGRABLE HAMILTONIAN SYSTEMS WITH TIME-DELAYED FEEDBACK CONTROL
Zhonghua Liu
,
W. Zhu
2008
Corpus ID: 55592797
The stochastic Hopf bifurcation of multi-degree-of-freedom (MDOF) quasi-integrable Hamiltonian systems with time-delayed feedback…
Expand
2004
2004
A Graph Edit Distance Based on Node Merging
S. Berretti
,
A. Bimbo
,
P. Pala
ACM International Conference on Image and Video…
2004
Corpus ID: 21613290
In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance…
Expand
Highly Cited
2004
Highly Cited
2004
Vom Wirkungsgefüge der Triebe
E. Holst
,
U. Saint Paul
Die Naturwissenschaften
2004
Corpus ID: 32953863
Ei~leitu~g," alas Lokalisatio~csproblem Der Menschengeist will seine Umwelt ordnen. Jedes Ding, das sieh nach Zweckbestimmung…
Expand
2002
2002
Simple and Practical Sequence Nearest Neighbors with Block Operations
S. Muthukrishnan
,
S. C. Sahinalp
Annual Symposium on Combinatorial Pattern…
2002
Corpus ID: 20703474
Sequence nearest neighbors problemc an be defined as follows. Given a database D of n sequences, preprocess D so that given any…
Expand
2001
2001
Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling
A. Torsello
,
E. Hancock
Energy Minimization Methods in Computer Vision…
2001
Corpus ID: 19103376
This paper investigates an approach to tree edit distance problem with weighted nodes. We show that any tree obtained with a…
Expand
1994
1994
Sample preparation perspectives : comparison of extraction disk and packed-ged cartridge technology in SPE
D. Blevins
,
S. K. Schultheis
1994
Corpus ID: 114599690
1986
1986
Ammonia Volatilization from Nitrogen Sources Applied to Rice Fields: II. Floodwater Properties and Submerged Photosynthetic Biomass1
I. Fillery
,
P. Roger
,
S. Datta
1986
Corpus ID: 59465038
AND s. K. DE DATTA~ __ ABSTRACT The effects of (NH4)zS04, urea, and urea amended with the urease inhibitor, phenyl…
Expand
1959
1959
Physiologie des Hörens
W. Keidel
Klinische Wochenschrift
1959
Corpus ID: 46650447
Das gesamte Gebiet der ,,Physiologie des HSrens" abh~ndeln zu soUen (es liegen allein fiber die Hydrodynamik und die Shmeszel]en…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required