16 search results - page 2 / 4 » The maximum edit distance from hereditary graph properties |
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...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
IJCV
2007
13 years 5 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
PR
2008
13 years 5 months ago
2008
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...