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) ...
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
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)+...
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...
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...