A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
Open Access
- 1 January 1988
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 31 (1) , 61-64
- https://doi.org/10.1093/comjnl/31.1.61
Abstract
A one-to-one correspondence between a set of non-regular trees that have ni internal nodes each with ki sons, for 1≤i≤t, and (m+1) leaves and a set of feasible codewords that have ni occurrences of ki, for 1≤i≤t, and m occurrences of 0 is proved to be isotone, where [equation: see PDF] A simple and efficient algorithm for generating a set of non-regular trees in lexicographic order is presented.Keywords
This publication has 0 references indexed in Scilit: