✦ LIBER ✦

Optimum Partitions of Tree Addressing Structures

✍ Scribed by Hosken, W. H.

Book ID: 118161172
Publisher: Society for Industrial and Applied Mathematics
Year: 1975
Tongue: English
Weight: 516 KB
Volume: 4
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0204029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex tree realizations of partitions

✍ Andreas Dress; Michael Steel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 326 KB

On tree-partitions of graphs

✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of gra

Adaptive partitioning strategies for ter

Adaptive partitioning strategies for ternary tree structures

✍ Jeffrey K. Uhlmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Optimum partitioning of rectilinear layo

Optimum partitioning of rectilinear layouts

✍ Nguyen, V.H. 📂 Article 📅 1996 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 414 KB

Canonical Partitions Of Universal Struct

Canonical Partitions Of Universal Structures

✍ C. Laflamme*; N. W. Sauer†; V. Vuksanovic 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 306 KB

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