✦ LIBER ✦

Generation of Trees without Duplications

✍ Scribed by Mayeda, W.; Seshu, S.

Book ID: 111964708
Publisher: Institute of Electrical and Electronics Engineers
Year: 1965
Tongue: English
Weight: 558 KB
Volume: 12
Category: Article
ISSN: 0018-9324
DOI: 10.1109/tct.1965.1082432

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On generation of trees without duplicati

On generation of trees without duplications

✍ Wai-Kai Chen 📂 Article 📅 1969 🏛 IEEE 🌐 English ⚖ 245 KB

Generation of Directed Trees and 2-Trees

Generation of Directed Trees and 2-Trees Without Duplication

✍ Paul, A., Jr. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 423 KB

Tree generation without duplication

✍ Fry, R.W.; Aatre, V.K. 📂 Article 📅 1970 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 423 KB

Generation of Complete Trees

✍ Mayeda, W.; Hakimi, S.; Chen, W.; Deo, N. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 506 KB

Computer generation of directed trees an

Computer generation of directed trees and complete trees†

✍ CHEN, WAI-KAI; LI, HEH CHING 📂 Article 📅 1973 🏛 Taylor and Francis Group 🌐 English ⚖ 490 KB

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