par Duchon, Philippe;Flajolet, Philippe;Louchard, Guy ;Schaeffer, Gilles
Référence Lecture notes in computer science, 2380 LNCS, page (501-513)
Publication Publié, 2002
Article révisé par les pairs
Résumé : This extended abstract proposes a surprisingly simple framework for the random generation of combinatorial configurations based on Boltzmann models. Random generation of possibly complex structured objects is performed by placingan appropriate measure spread over the whole of a combinatorial class. The resultingalg orithms can be implemented easily within a computer algebra system, be analysed mathematically with great precision, and, when suitably tuned, tend to be efficient in practice, as they often operate in linear time. © 2002 Springer-Verlag Berlin Heidelberg.