Sciweavers

2 search results - page 1 / 1
» A Convolution Edit Kernel for Error-tolerant Graph Matching
Sort
View
ICPR
2006
IEEE
14 years 5 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
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...
Horst Bunke, Michel Neuhaus
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