On the loopless generation of binary tree sequences

Information Processing Letters

Volumn 68, Issue 3, 1998, Pages 113-117

  Vajnovszki, Vincent ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Binary tree sequences; Combinatorial problems; Design of algorithms; Loopless generating algorithms

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); PROBLEM SOLVING; RECURSIVE FUNCTIONS; TREES (MATHEMATICS);

BINARY TREE SEQUENCES; GRAY CODE; LOOPLESS GENERATION ALGORITHMS; WILLIAMSON ALGORITHM;

BINARY SEQUENCES;

EID: 0032203353     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00155-0     Document Type: Article

References (14)

1. Y. Koda, F. Ruskey, A Gray code for the ideals of a forest poset, J. Algorithms 15 (1993) 324-340.
2. J.F. Korsh, Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52 (1994) 243-247.
3. J.M. Lucas, The rotations graph of binary trees is Hamiltonian, J. Algorithms 9 (1988) 503-535.
4. J.M. Lucas, D. Roelants van Baronaigien, F. Ruskey, On rotations and the generation of binary trees, J. Algorithms 15 (1993) 343-366.
5. K. Mikawa, T. Takaoka, Generation of parenthesis strings by transpositions, in: Proc. CATS'97, Sydney, Australia, February 1997.
6. J.M. Pallo, Enumerating, ranking and unranking binary trees, Comput. J. 29 (1986) 171-175.
7. D. Roelants van Baronaigien, F. Ruskey, A Hamiltonian path in the rotation lattice of binary trees, Congr. Numer. 59 (1987) 313-318.
8. D. Roelants van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39 (1991) 189-194.
9. F. Ruskey, A. Proskurowski, Generating binary trees by transpositions, J. Algorithms 11 (1990) 68-84.
10. V. Vajnovszki, Loopless algorithm for generating well-formed parenthesis strings, Research Report Department IEM, University of Burgundy, September 1997.
11. V. Vajnovszki, J. Pallo, Parallel algorithms for generating well-formed parenthesis strings, Parallel Process. Lett. 8 (1) (1998) 19-28.
12. T.R. Walsh, A simple sequencing and ranking method that works on almost all Gray codes, Research Report No. 243, Department of Mathematics and Computer Science, University of Quebec in Montreal, 1995.
13. S.G. Williamson, Combinatorics for Computer Science, Computer Science Press, Rockville, MD, 1985.
14. D. Zerling, Generating binary trees using rotations, J. ACM 32 (1985) 694-701.