Generating regular k-ary trees efficiently

Computer Journal

Volumn 43, Issue 4, 2000, Pages 290-300

  Xiang, Limin ^a   Ushijima, Kazuo ^a   Akl, Selim G ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT FREE GRAMMARS; ENCODING (SYMBOLS); INTEGER PROGRAMMING; RECURSIVE FUNCTIONS;

BINARY TREE CODING; INTERNAL NODES;

TREES (MATHEMATICS);

EID: 0034517316     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/43.4.290     Document Type: Article

References (27)

1. Bapiraju, V. and Rao, V. V. B. (1994) Enumeration of binary trees. Inform. Process. Lett., 51, 125-127.
2. van Baronaigien, D. R. (1991) A loopless algorithm for generating binary tree sequences. Inform. Process. Lett., 39, 189-194.
3. Er, M. C. (1985) Enumerating ordered trees lexicographically. Comput. J., 28, 538-542.
4. Knott, G. D. (1977) A numbering system for binary trees. Comm. ACM, 20, 113-115.
5. Lucas, J. M., van Baronaigien, D. R. and Ruskey, F. (1993) On rotations and the generation of binary trees. J. Algorithms, 15, 343-366.
6. Pallo, J. (1986) Enumerating, ranking and unranking binary trees. Comput. J., 29, 171-175.
7. Pallo, J. and Racca, R. (1985) A note on generating binary trees in A-order and B-order. Int. J. Computer Math., 18, 27-39.
8. Proskurowski, A. (1980) On the generation for binary trees. J. ACM, 27, 1-2.
9. Rotem, D. and Varol, Y. L. (1978) Generation of binary trees from ballot sequences. J. ACM, 25, 396-404.
10. Solomon, M. and Finkel, R. A. (1980) A note on enumerating binary trees. J. ACM, 27, 3-5.
11. Xiang, L., Tang, C. and Ushijima, K. (1997) Grammar-oriented enumeration of binary trees. Comp. J., 40, 278-291.
12. Xiang, L. and Ushijima, K. (1997) Iterative formulas for enumerating binary trees. Res. Rep. Inform. Sci. Elect. Kyushu Univ. (ISSN 1342-3819), 2, 179-183.
13. Zerling, D. (1985) Generating binary trees using rotations. J. ACM, 32, 694-701.
14. Vajnovszki, V. (1998) On the loopless generation of binary tree sequences. Inform. Process. Lett., 68, 113-117.
15. Zaks, S. (1980) Lexicographic generation of ordered trees. Theor. Comput. Sci., 10, 63-82.
16. Er, M. C. (1992) Efficient generation of k-ary trees in natural order. Comput. J., 35, 306-308.
17. Kemp, R. (1998) Generating words lexicographically: An average-case analysis. Acta Inform., 35, 17-89.
18. Akl, S. G. and Stojmenovic, I. (1996) Generating t-ary trees in parallel, Nordic J. Comput., 3, 63-71.
19. Ruskey, F. (1978) Generating t-ary trees lexicographically. SIAM J. Comput., 1, 424-439.
20. Korsh, J. F. (1994) Loopless generation of k-ary tree sequences. Inform. Process. Lett., 52, 243-247.
21. Korsh, J. F. and Lipschutz, S. (1998) Shifts and loopless generation of k-ary trees. Inform. Process. Lett., 65, 235-240.
22. Korsh, J. F. and LaFollette, P. (1999) Loopless generation of Gray codes for k-ary trees. Inform. Process. Lett., 70, 7-11.
23. van Baronaigien, D. R. (2000) A loopless gray-code algorithm for listing k-ary trees. J. Algorithms, 35, 100-107.
24. Xiang, L., Ushijima, K. and Tang, C. (2000) Efficient loopless generation of Gray codes for k-ary trees. Inform. Process. Lett., to appear.
25. Knuth, D. E. (1997) The Art of Computer Programming. Vol.1, Fundamental Algorithms (3rd edn). Addison-Wesley, Reading, MA.
26. Xiang, L. and Ushijima, K. (1999) Grammar-oriented enumeration of arbitrary trees and arbitrary k-ary trees. IEICE Trans. Inform. Syst., E82-D, 1245-1253.
27. Hopcroft, J. E. and Ullman, J. D. (1969) Formal Languages and their Relation to Automata. Addison-Wesley, Reading, MA.