论文信息 - Efficient loopless generation of Gray codes for k-ary trees

Efficient loopless generation of Gray codes for k-ary trees

Abstract Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless algorithm [Inform. Process. Lett. 70 (1999) 7] to generate Gray codes for k -ary trees. In this paper, another loopless algorithm is presented to list Gray codes for k -ary trees more efficiently in both space and time than the two former algorithms, and the algorithm is also conceptually simpler than the predecessors. Based on the algorithm, Gray codes for k -ary trees with n internal nodes ( n≥2 and k>3 ) can be generated in at least 2 2(n−1) different ways easily.

Changjie Tang | Kazuo Ushijima | Limin Xiang

[1] Kazuo Ushijima,et al. Grammar-Orientad Enumeration of Arbitrary Trees and Arbitrary k-ary Trees , 1999 .

[2] Changjie Tang,et al. On generating k-ary trees in computer representation , 2001, Inf. Process. Lett..

[3] James F. Korsh. Loopless Generation of k-Ary Tree Sequences , 1994, Inf. Process. Lett..

[4] Shmuel Zaks,et al. Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[5] James F. Korsh,et al. Loopless Generation of Gray Codes for k-Ary Trees , 1999, Inf. Process. Lett..

[6] Changjie Tang,et al. Grammar-Oriented Enumeration of Binary Trees , 1997, Comput. J..

[7] Dominique Roelants van Baronaigien. A Loopless Algorithm for Generating Binary Tree Sequences , 1991, Inf. Process. Lett..

[8] Vincent Vajnovszki,et al. On the Loopless Generation of Binary Tree Sequences , 1998, Inf. Process. Lett..

[9] S. G. Williamson,et al. Combinatorics for computer science , 1985 .

[10] Frank Ruskey,et al. On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[11] Dominique Roelants van Baronaigien. A Loopless Gray-Code Algorithm for Listing k-ary Trees , 2000, J. Algorithms.

[12] James F. Korsh,et al. Shifts and Loopless Generation of k-Ary Trees , 1998, Inf. Process. Lett..

[13] David Zerling,et al. Generating binary trees using rotations , 1985, JACM.

[14] Jean Marcel Pallo,et al. Enumerating, Ranking and Unranking Binary Trees , 1986, Comput. J..