Tree edge decomposition with an application to minimum ultrametric tree approximation

A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the problem how many levels it is sufficient to decompose the edges of a tree. In this paper, we show that any n-edge tree can be 2-decomposed (and 3

• Type: Journal
• Year: 2006
• Where: JCO
• Authors: Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
• Keywords: Edge-disjoint Subtrees, JCO 2006, N-edge Tree, Tree