𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal chain partitions of trees

✍ Scribed by Jayadev Misra; R.Endre Tarjan

Book ID
113161825
Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
457 KB
Volume
4
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal Partition Trees
Optimal Partition Trees
✍ Timothy M. Chan πŸ“‚ Article πŸ“… 2012 πŸ› Springer 🌐 English βš– 887 KB
Decision trees with optimal joint partit
Decision trees with optimal joint partitioning
✍ Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 544 KB

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of t

Optimality of consecutive and nested tre
Optimality of consecutive and nested tree partitions
✍ Chang, G. J.; Hwang, F. K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 84 KB

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons

On partitions of graphs into trees
On partitions of graphs into trees
✍ F.R.K. Chung πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.