✦ LIBER ✦

Optimal B-tree packing

✍ Scribed by Timothy M Klein; Kenneth J Parzygnat; Alan L Tharp

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 445 KB
Volume: 16
Category: Article
ISSN: 0959-2954
DOI: 10.1016/0306-4379(91)90017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal tree packing

✍ A. V. Anisimov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 286 KB

Flash-Optimized B+-Tree

✍ Sai Tung On; Haibo Hu; Yu Li; Jianliang Xu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 513 KB

Construction of a minimal tree packing i

Construction of a minimal tree packing in optimal memory allocation

✍ N. M. Khaikin; E. I. Zak 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 618 KB

An asymptotically optimal multiversion B

An asymptotically optimal multiversion B-tree

✍ Bruno Becker; Stephan Gschwind; Thomas Ohler; Bernhard Seeger; Peter Widmayer 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

Optimal rectangle packing

✍ Richard E. Korf; Michael D. Moffitt; Martha E. Pollack 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 648 KB

Packing three trees

✍ Mariusz Woźniak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We present some results concerning edge-disjoint placement of two or three copies of a tree, as well as a theorem about the packing of three trees into the complete graph K,. ## 1. Terminology We shall use standard graph theory notation. A finite, undirected graph G consists of a vertex set V(G) a