Efficient loopless generation of Gray codes for k-ary trees

Information Processing Letters

Volumn 76, Issue 4-6, 2000, Pages 169-174

  Xiang, Limin ^a   Ushijima, Kazuo ^a   Tang, Changjie ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b SICHUAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; IMAGE CODING; TREES (MATHEMATICS);

LOOPLESS ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0034509130     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00139-3     Document Type: Article

References (15)

1. Korsh J.F. Loopless generation of k -ary tree sequences. Inform. Process. Lett. Vol. 52:1994;243-247.
2. Korsh J.F., LaFollette P. Loopless generation of Gray codes for k -ary trees. Inform. Process. Lett. Vol. 70:1999;7-11.
3. Korsh J.F., Lipschutz S. Shifts and loopless generation of k -ary trees. Inform. Process. Lett. Vol. 65:1998;235-240.
4. Lucas J.M., Roelants van Baronaigien D., Ruskey F. On rotations and the generation of binary trees. J. Algorithms. Vol. 15:1993;343-366.
5. Pallo J.M. Enumerating, ranking and unranking binary trees. Comput. J. Vol. 29:1986;171-175.
6. Vajnovszki V. On the loopless generation of binary tree sequences. Inform. Process. Lett. Vol. 68:1998;113-117.
7. Roelants van Baronaigien D. A loopless algorithm for generating binary tree sequences. Inform. Process. Lett. Vol. 39:1991;189-194.
8. Roelants van Baronaigien D. A loopless Gray-code algorithm for listing k -ary trees. J. Algorithms. Vol. 35:2000;100-107.
9. Roelants van Baronaigien D., Ruskey F. A Hamiltonian path in the rotation lattice of binary trees. Congr. Numer. Vol. 59:1987;313-318.
10. Williamson S.G. Combinatorics for Computer Science. 1985;Computer Science Press, Rockville, MD.
11. Xiang L., Tang C., Ushijima K. Grammar-oriented enumeration of binary trees. Comput. J. Vol. 40:1997;278-291.
12. Xiang L., Ushijima K. Grammar-oriented enumeration of arbitrary trees and arbitrary k -ary trees. IEICE Trans. Inform. & Syst. Vol. E82-D:1999;1245-1253.
13. Xiang L., Ushijima K., Tang C. On generating k -ary trees in computer representation. Inform. Process. Lett. Vol. 78:2001;. to appear.
14. Zaks S. Lexicographic generation of ordered trees. Theoret. Comput. Sci. Vol. 10:1980;63-82.
15. Zerling D. Generating binary trees using rotations. J. ACM. Vol. 32:1985;694-701.