𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost Optimal Dynamic 2–3 trees

✍ Scribed by Wanxue Li

Book ID
112947308
Publisher
Springer
Year
1986
Tongue
English
Weight
417 KB
Volume
1
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic Optimality—Almost
Dynamic Optimality—Almost
✍ Demaine, Erik D.; Harmon, Dion; Iacono, John; P traşcu, Mihai 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 160 KB
Almost all trees have tribe number 2 or
Almost all trees have tribe number 2 or 3
✍ J. Komlós; W.O.J. Moser 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Let T be a tree on n vertices, and let E <$ be a small fixed positive number. The tribe number t&) of T is the smallest integer r such that when any vertex is deleted, some r or fewer subtrees in the resulting forest together contain more than (1-e)n vertices. We prove the following, theorem: Almost

Optimal Dynamic Embeddings of Complete B
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 242 KB

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf

2–3 brother trees
2–3 brother trees
✍ H. P. Kriegel; V. K. Vaishnavi; D. Wood 📂 Article 📅 1978 🏛 Springer Netherlands 🌐 English ⚖ 440 KB