Random generation of trees and other combinatorial objects

Theoretical Computer Science

Volumn 218, Issue 2, 1999, Pages 219-232

  Barcucci, Elena ^a   Del Lungo, Alberto ^a   Pergola, Elisa ^a  

^a Dipartimento di Sistemi e Informatica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346397785     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00322-3     Document Type: Article

References (14)

1. L. Alonso, R. Schott, Random Generation of Trees: Random Generation in Computer Science, Kluwer Academic, Dordrecht, 1995.
2. M.D. Atkinson, L. Walker, Enumerating k-way trees, Inform. Proces. Lett. 48 (1993) 73-75.
3. E. Barcucci, A. Del Lungo, S. Fezzi, R. Pinzani, Nondecreasing Dyck paths and q-Fibonacci numbers, Discrete Math. 170 (1997) 211-217.
4. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Towards a methodology for plane tree enumeration, Proc. 7th FPSAC, Marne-la-Vallee, 1995, pp. 53-65.
5. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A construction for enumerating k-coloured Motzkin paths, Lecture Notes in Computer Science, vol. 959, 1995, pp. 254-263.
6. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A methodology for plane tree enumeration, Discrete Math. 180 (1998) 45-64.
7. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Some permutations with forbidden subsequences and their inversion number, Discrete Math., submitted.
8. A. Denise, Méthodes de génération aléatoire d'objects combinatoires de grande taille et problèmes d'énumeration, Thèse de l'Université Bordeaux I, 1994.
9. P. Flajolet, P. Zimmermann, B. Van Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoret. Comput. Sci. 132 (1994) 1-35.
10. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Math., Addison-Wesley, New-York, 1989.
11. T. Hickey, J. Cohen, Uniform random generation of strings in a context-free language, SIAM J. Comput. 12 (1983) 645-655.
12. B. Johnsen, Generating binary trees with uniform probability, BIT 31 (1991) 15-31.
13. A. Nijenhuis, H.S. Wilf, Combinatorial Algorithms, Academic Press, New York, 1979.
14. H.S. Wilf, A unified setting for sequencing, ranking and selection algorithms for combinatorial objects, Adv. Math. 24 (1977) 281-291.