✦ LIBER ✦

Representation of ordered trees

✍ Scribed by A. V. Anisimov; I. V. Karpenko; V. V. Krizhanovskii

Publisher: Springer US
Year: 1981
Tongue: English
Weight: 623 KB
Volume: 16
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01078252

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Internal path length of the binary repre

Internal path length of the binary representation of heap-ordered trees

✍ Wen-Chin Chen; Wen-Chun Ni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Generating ordered trees

✍ Wladyslaw Skarbek 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Isotonic median regression for orders re

Isotonic median regression for orders representable by rooted trees

✍ Nilotpal Chakravarti 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 914 KB

Representation of partially ordered sets

✍ Paula Kemp 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 178 KB

POTMiner: mining ordered, unordered, and

POTMiner: mining ordered, unordered, and partially-ordered trees

✍ Aída Jiménez; Fernando Berzal; Juan-Carlos Cubero 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 946 KB

Skew Diagrams and Ordered Trees

✍ Robert G. Rieper; Melkamu Zeleke 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We use a known combinatorial argument to prove that among all ordered trees the ratio of the total number of vertices to leaves is two. We introduce a new combinatorial bijection on the set of these trees that shows why this must be so. Ordered trees are then enumerated by number of leaves, total pa