Sciweavers

19 search results - page 1 / 4
» Edit Distance From Graph Spectra
Sort
View
ICCV
2003
IEEE
13 years 10 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock
PR
2008
206views more  PR 2008»
13 years 4 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
ICPR
2004
IEEE
14 years 5 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ISCI
2007
170views more  ISCI 2007»
13 years 4 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
JGT
2008
91views more  JGT 2008»
13 years 4 months ago
On the editing distance of graphs
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...
Maria Axenovich, André E. Kézdy, Rya...