✦ LIBER ✦

Coding and generation of nonisomorphic trees

✍ Scribed by A. V. Kozina

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 666 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071214

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of tree algorithms. Vector code

Analysis of tree algorithms. Vector codes. Generation of random structures and tree characteristics

✍ A. P. Zavada; G. P. Kozhevnikova 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 646 KB

The Asymptotic Number of Inequivalent Bi

The Asymptotic Number of Inequivalent Binary Codes and Nonisomorphic Binary Matroids

✍ Marcel Wild 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The asymptotic value as nPR of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids.

Prefix codes, trees, and automata

✍ Jean-Louis Lassez 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Bijective Linear Time Coding and Decodin

Bijective Linear Time Coding and Decoding fork-Trees

✍ Saverio Caminiti; Emanuele G. Fusco; Rossella Petreschi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 532 KB

Computer enumeration and generation of p

Computer enumeration and generation of physical trees

✍ J. V. Knop; W. R. Müller; K. Szymanski; H. W. Kroto; N. Trinajstić 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

A computer-oriented method for the enumeration and generation of physical trees is presented. Physical trees depict acyclic chemical structures, but the term physical is used to stress the process by which the structures are produced.

Efficient generation of plane trees

✍ Shin-ichi Nakano 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without dupl