156 search results - page 4 / 32 » Edge ranking of weighted trees |
PPAM
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
CPC
2008
13 years 7 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
SIAMDM
2010
13 years 5 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...