1154 search results - page 2 / 231 » On the editing distance of graphs |
JGT
2008
13 years 5 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
RSA
2008
13 years 4 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
BPM
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...