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)

Related topics

Related topics

25 relations
A* search algorithmAPXCheminformaticsComputer science

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Approximation of Graph Edit Distance in Quadratic Time
The basic idea of a recent graph matching framework is to reduce the problem of graph edit distance (GED) to an instance of a… 
2010
2010
Metamodel Matching Based on Planar Graph Edit Distance
A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and… 
Highly Cited
2010
Highly Cited
2010
Ranking BPEL Processes for Service Discovery
Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval… 
2008
2008
Archivalterity: Rethinking Original Order
Although their objects of analysis are different, traditional textual criticism and the classical archival theory of arrangement… 
2007
2007
Structure Preserving Semantic Matching
A rotary potentiometer is provided with a switch, preferably as a final control element for the control of electrical machinery… 
2004
2004
A Graph Edit Distance Based on Node Merging
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
Vom Wirkungsgefüge der Triebe
Ei~leitu~g," alas Lokalisatio~csproblem Der Menschengeist will seine Umwelt ordnen. Jedes Ding, das sieh nach Zweckbestimmung… 
2002
2002
Toward a P300-based Computer Interface
This paper describes our initial research into the use of the P300 event related potential as a control signal in a computer… 
2002
2002
Simple and Practical Sequence Nearest Neighbors with Block Operations
Sequence nearest neighbors problemc an be defined as follows. Given a database D of n sequences, preprocess D so that given any… 
1986
1986
Ammonia Volatilization from Nitrogen Sources Applied to Rice Fields: II. Floodwater Properties and Submerged Photosynthetic Biomass1
AND s. K. DE DATTA~ __ ABSTRACT The effects of (NH4)zS04, urea, and urea amended with the urease inhibitor, phenyl… 
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)