Loopless generation of Gray codes for k-ary trees

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 7-11

  Korsh, James F ^a   LaFollette, Paul ^a  

^a TEMPLE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMBINATORIAL MATHEMATICS;

GRAY CODES; LOOPLESS GENERATION ALGORITHM;

TREES (MATHEMATICS);

EID: 0033574363     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00035-6     Document Type: Article

References (9)

1. J.F. Korsh, Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52 (1994) 243-247.
2. J.F. Korsh, S. Lipschutz, Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65 (1998) 235-240.
3. J.M. Lucas, D.R. van Baronaigien, F. Ruskey, On rotations and the generation of binary trees, J. Algorithms 15 (1993) 1-24.
4. J.M. Pallo, Enumerating, ranking and unranking binary trees, Computer J. 29 (1986) 171-175.
5. D. Roelants van Baronaigien, F. Ruskey, A Hamiltonian path in the rotation lattice of binary trees, Congressus Numer. 59 (1987) 313-318.
6. D. Roelants van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39 (1991) 189-194.
7. D. Roelants van Baronaigien, Loopfree generation of k-ary trees, Technical Report, DCS-254-IR, Department of Computer Science, University of Victoria, 1997.
8. V. Vajnovszki, On the loopless generation of binary tree sequences, Inform. Process. Lett., to appear.
9. S.G. Williamson, Combinatorics for Computer Science, Computer Science Press, Rockville, MD, 1985.