Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,290,946 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.
Review
2017
Review
2017
A Survey on Applications of Bipartite Graph Edit Distance
Michael Stauffer
,
Thomas Tschachtli
,
Andreas Fischer
,
Kaspar Riesen
Workshop on Graph Based Representations in…
2017
Corpus ID: 13178821
International Workshop on Graph-Based Representations in Pattern Recognition. GbRPR 2017: Graph-Based Representations in Pattern…
Expand
2016
2016
CSI_GED: An efficient approach for graph edit similarity computation
K. Gouda
,
M. Hassaan
IEEE International Conference on Data Engineering
2016
Corpus ID: 14053239
Graph similarity is a basic and essential operation in many applications. In this paper, we are interested in computing graph…
Expand
Review
2013
Review
2013
A Novel Software Toolkit for Graph Edit Distance Computation
Kaspar Riesen
,
S. Emmenegger
,
H. Bunke
Workshop on Graph Based Representations in…
2013
Corpus ID: 36828667
Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit…
Expand
Highly Cited
2011
Highly Cited
2011
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
S. Fankhauser
,
Kaspar Riesen
,
H. Bunke
Workshop on Graph Based Representations in…
2011
Corpus ID: 30361958
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing objects. The main…
Expand
2007
2007
A Quadratic Programming Approach to the Graph Edit Distance Problem
M. Neuhaus
,
H. Bunke
Workshop on Graph Based Representations in…
2007
Corpus ID: 9878466
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit…
Expand
2003
2003
Edit distance from graph spectra
A. Robles-Kelly
,
E. Hancock
Proceedings Ninth IEEE International Conference…
2003
Corpus ID: 6522945
We are concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing…
Expand
Highly Cited
2002
Highly Cited
2002
Evaluating Structural Similarity in XML Documents
Andrew Nierman
,
H. V. Jagadish
International Workshop on the Web and Databases
2002
Corpus ID: 13306195
XML documents on the web are often found without DTDs, particularly when these documents have been created from legacy HTML. Yet…
Expand
Highly Cited
2000
Highly Cited
2000
Effect of Crystal Orientation on Fatigue Failure of Single Crystal Nickel Base Turbine Blade Superalloys
N. Arakere
,
G. Swanson
2000
Corpus ID: 45024745
High cycle fatigue (HCF) induced failures in aircraft gas turbine and rocket engine turbopump blades is a pervasive problem…
Expand
Highly Cited
2000
Highly Cited
2000
An Inverse Global Environmental Kuznets Curve
R. Jha
,
K. B. Murthy
2000
Corpus ID: 53642705
This paper articulates the necessity of emphasizing the absolute level of environmental degradation in different countries as a…
Expand
Highly Cited
1999
Highly Cited
1999
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
H. Bunke
IEEE Transactions on Pattern Analysis and Machine…
1999
Corpus ID: 27017123
Investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost…
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