Sciweavers

JCO
2006

Tree edge decomposition with an application to minimum ultrametric tree approximation

13 years 11 months ago
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
Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JCO
Authors Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
Comments (0)