1664 search results - page 10 / 333 » Distance labeling in graphs |
COMBINATORICS
2000
14 years 9 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
100
click to vote
IAT
2009
IEEE
15 years 1 months ago
2009
IEEE
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
DAM
2008
14 years 10 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...