✦ LIBER ✦

Generating ordered trees

✍ Scribed by Wladyslaw Skarbek

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 648 KB
Volume: 57
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90169-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation of ordered trees

✍ A. V. Anisimov; I. V. Karpenko; V. V. Krizhanovskii 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 623 KB

Generating binary trees at random

✍ M.D. Atkinson; J.-R. Sack 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Generating binary trees by transposition

Generating binary trees by transpositions

✍ Frank Ruskey; Andrzej Proskurowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 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

Protected points in ordered trees

✍ Gi-Sang Cheon; Louis W. Shapiro 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 198 KB

In this note we start by computing the average number of protected points in all ordered trees with n edges. This can serve as a guide in various organizational schemes where it may be desirable to have a large or small number of protected points. We will also look a few subclasses with a view to in