Boltzmann sampling of ordered structures

Electronic Notes in Discrete Mathematics

Volumn 35, Issue C, 2009, Pages 305-310

  Roussel, Olivier ^a   Soria, Michèle ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Algorithms and data structures; Analytic combinatorics; Boltzmann model; Random sampling; Randomized algorithm

Indexed keywords

EID: 70949087956     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2009.11.050     Document Type: Article

References (7)

1. Bergeron F., Flajolet P., and Salvy B. Varieties of increasing trees (1992), Springer pp. 24-48
2. Bergeron F., Labelle G., and Leroux P. Combinatorial species and tree-like structures (1998), Cambridge University Press
3. Duchon P., Flajolet P., Louchard G., and Schaeffer G. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing 13 (2004) 577-625
4. Flajolet, P., E. Fusy and C. Pivoteau, Boltzmann sampling of unlabelled structures, Proceedings of ANALCO 7
5. Flajolet P., and Sedgewick R. Analytic combinatorics (2008), Cambridge University Press
6. Greene, D., Labelled formal languages and their uses (1983)
7. Nijenhuis A., and Wilf H. Combinatorial algorithms (1978) New York