1154 search results - page 35 / 231 » On the editing distance of graphs |
CPM
2008
Springer
13 years 10 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
MICCAI
2006
Springer
14 years 9 months ago
2006
Springer
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
EJC
2006
13 years 8 months ago
2006
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...