Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets [chapter]

Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2017 Lecture Notes in Computer Science  
In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits.
doi:10.1007/978-3-319-58747-9_9 fatcat:5i5n2mwrljh53jfwqhhoupzbr4