Shifts and loopless generation of k-ary trees

Information Processing Letters

Volumn 65, Issue 5, 1998, Pages 235-240

  Korsh, James F ^a   Lipschutz, Seymour ^b  

^a Temple University   (United States)

^b Temple University   (United States)

Author keywords

Binary trees; Combinatorial algorithms; Combinatorial problems; Data structures; K ary trees; Loopless generation

Indexed keywords

EID: 0000656771     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00215-9     Document Type: Article

References (4)

1. J.F. Korsh, Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52 (1994) 243-247.
2. J.M. Lucas, D. Roelants van Baronaigien, F. Ruskey, On rotations and the generation of binary trees, J. Algorithms 15 (1993) 1-24.
3. D. Roelants van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39 (1991) 189-194.
4. D. Roelants van Baronaigien, F. Ruskey, Generating t-ary trees in A-order, Inform. Process. Lett. 27 (1988) 205-213.