Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,794,439 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.
2016
2016
SoRTESum: A Social Context Framework for Single-Document Summarization
Minh-Tien Nguyen
,
M. Nguyen
European Conference on Information Retrieval
2016
Corpus ID: 206690698
The combination of web document contents, sentences and users’ comments from social networks provides a viewpoint of a web…
Expand
2011
2011
Seroprevalence of Coxiella burnetii Antibodies in High Risk Groups in Eastern Turkey
M. Berktaş
,
E. Ceylan
,
Görkem Yaman
,
I. Ciftci
2011
Corpus ID: 53930203
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…
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
2007
2007
Change Detection in Web Pages
Divakar Yadav
,
A. Sharma
,
J. Gupta
10th International Conference on Information…
2007
Corpus ID: 2755321
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…
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
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
Review
2001
Review
2001
The Relationship Between Self-Directed Learning and Learning Styles
James B. Canipe
2001
Corpus ID: 140857712
The purpose of this study was to examine the relationship between self-directed learning readiness and learning styles. A cluster…
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