Ranking and Listing Algorithms for k-Ary Trees
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4) , 492-509
- https://doi.org/10.1137/0207039
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Generating t-Ary Trees LexicographicallySIAM Journal on Computing, 1978
- Generating Binary Trees LexicographicallySIAM Journal on Computing, 1977
- A numbering system for binary treesCommunications of the ACM, 1977
- On the sequential and random selection of subspaces over a finite fieldJournal of Combinatorial Theory, Series A, 1977
- On the ordering, ranking, and random generation of basic combinatorial setsPublished by Springer Nature ,1977
- Ranking Algorithms for Lists of PartitionsSIAM Journal on Computing, 1976
- Ranking Algorithms: The Symmetries and Colorations of the n -CubeSIAM Journal on Computing, 1976