1664 search results - page 258 / 333 » Distance labeling in graphs |
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
DM
1998
14 years 11 months ago
1998
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
141
click to vote
COR
2008
14 years 11 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...
KDD
2002
ACM
16 years 9 days ago
2002
ACM
This paper presents new methods for automatically integrating, summarizing and evaluating multimedia knowledge. These are essential for multimedia applications to efficiently and ...