720 search results - page 2 / 144 » Linear k-arboricities on trees |
CAI
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
DLT
2008
13 years 6 months ago
2008
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...