Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

81

Voted

JCO
2006

favoriteEmaildiscussreport

66views more JCO 2006»

Tree edge decomposition with an application to minimum ultrametric tree approximation

14 years 10 months ago

Tree edge decomposition with an application to minimum ultrametric tree approximation

Download par.cse.nsysu.edu.tw

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

Real-time Traffic

Edge-disjoint Subtrees | JCO 2006 | N-edge Tree | Tree |

claim paper

Related Content

» Circular partitions with applications to visualization and embeddings

» A Benders decomposition approach for the robust spanning tree problem with interval data

» Minimum moment Steiner trees

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» On the Crossing Spanning Tree Problem

» Minimizing the stabbing number of matchings trees and triangulations

» Primaldual meets local search approximating MSTs with nonuniform degree bounds

» Multicommodity Demand Flow in a Tree

Post Info
More Details (n/a)

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)