110 search results - page 1 / 22 » A degree bound on decomposable trees |
DM
2006
13 years 8 months ago
2006
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
ESA
2006
Springer
14 years 3 days 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...