110 search results - page 5 / 22 » A degree bound on decomposable trees |
WG
2004
Springer
14 years 1 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
ESA
1994
Springer
14 years 16 days ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
ALGORITHMICA
2005
13 years 8 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...