A Linear-Time Algorithm for the Generation of Trees

Algorithmica (New York)

Volumn 17, Issue 2, 1997, Pages 162-182

  Alonso, L ^a   Remy J L ^a   Schott, R ^a  

^a INRIA   (France)

Author keywords

Coding; Linear time algorithm; Random generation; Trees

Indexed keywords

EID: 0042689495     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02522824     Document Type: Article

References (10)

1. L. Alonso, Uniform generation of a Motzkin word, Theoret. Comput. Sci., 134(2):529-536, 1994.
2. L. Alonso, R. Schott, A parallel algorithm for the generation of permutations, to appear in Theoret. Comput. Sci., 1996.
3. N. Dershowitz, S. Zaks, Patterns in trees, Discrete Appl. Math., 25:241-255, 1989.
4. N. Dershowitz, S. Zaks, The Cycle Lemma and some applications, European J. Combin., 11:35-40, 1990.
5. A. Dvoretzky, Th. Motzkin, A problem of arrangements, Duke Math. J., 24:305-313, 1947.
6. P. Flajolet, P. Zimmermann, B. V. Cutsem, A calculus for the generation of combinatorial structures, Theoret. Comput. Sci., 132:1-35, 1994.
7. J. L. Rémy, Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire, RAIRO Inform. Théor., 19(2):179-195, 1985.
8. M. P. Schützenberger, Context-free languages and pushdown automata. Inform. Control. 6:246-261, 1963.
9. D. M. Silberger, Occurrences of the integer (2n - 2)!/n!(n - 1)!, Roczniki Polskiego Towarzystwa Math. 1, (13):91-96, 1969.
10. J. S. Vitter, Optimum algorithms for two random sampling problems, Proc. FOCS 83, pp. 65-75, 1983.