A Loopless Gray-Code Algorithm for Listing k-ary Trees

Journal of Algorithms

Volumn 35, Issue 1, 2000, Pages 100-107

  Roelants Van Baronaigien, Dominique ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003374193     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1073     Document Type: Article

References (22)

1. J. Bitner, G. Ehrlich, and E. Reingold, Efficient generation of the binary reflected Gray code and its applications, Comm. Assoc. Comput. Mach. 19(9) (1976), 517-521.
2. B. Bultena and F. Ruskey, An Eades-McKay algorithm for well-formed parenthesis strings, Inform. Process. Lett. 68 (1998), 255-259.
3. E. R. Canfield and S. G. Williamson, A loop-free algorithm for generating the linear extensions of a poset, Order 12 (1995), 57-75.
4. P. J. Chase, Combination generation and Graylex ordering, Congr. Numer. 69 (1989), 215-242.
5. G. Ehrlich, Loopless algorithms for generating permutations, combinations, and other combinatorial configurations, J. Assoc. Comput. Mach. 20 (1973), 500-513.
6. J. F. Korsh, Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52 (1994), 243-247.
7. J. F. Korsh and S. Lipschutz, Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65 (1998), 235-240.
8. J. Lucas, The rotation graph of binary trees is Hamiltonian, J. Algorithms 8 (1987), 503-535.
9. J. Lucas, D. Roelants van Baronaigien, and F. Ruskey, On rotations and the generation of binary trees, J. Algorithms 15 (1993), 343-366.
10. K. Mikawa and T. Takaoka, Generation of parenthesis strings by transpositions, in "Proceedings of CATS'97," Sydney, Australia, 1997, pp. 51-58.
11. J. Pallo, Enumerating, ranking, and unranking binary trees, Comput. J. 29 (1986), 171-175.
12. A. Proskurowski, On the generation of binary trees, J. Assoc. Comput. Mach. 27 (1980), 1-2.
13. A. Proskurowski and F. Ruskey, Binary tree Gray codes, J. Algorithms 6 (1985), 225-238.
14. D. Roelants van Baronaigien and F. Ruskey, Generating t-ary trees in a-order, Inform. Process. Lett. 27 (1988), 205-213.
15. D. Roelants van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39 (1991), 189-194.
16. F. Ruskey, Generating t-ary trees lexicographically, SIAM J. Comput. 7 (1978), 492-509.
17. F. Ruskey and T. C. Hu, Generating binary trees lexicographically, SIAM J. Comput. 6 (1977), 745-758.
18. F. Ruskey and A. Proskurowski, Generating binary trees by transpositions, J. Algorithms 11 (1990), 68-84.
19. C. D. Savage, A survey of combinatorial Gray codes, SIAM Rev. 39 (1997), 605-629.
20. T. R. Walsh, Generation of well-formed parenthesis strings in constant worst case time, J. Algorithms 29 (1998), 165-173.
21. S. Zaks, Generation and ranking of k-ary trees, Inform. Process. Lett. 14 (1982), 44-48.
22. D. Zerling, Generating binary trees using rotations, J. Assoc. Comput. Mach. 32 (1985), 694-701.