Entropic uniform sampling of linear extensions in series-parallel posets

DOI10.1007/978-3-319-58747-9_9MaRDI QIDQ2399366zbMATH OpenOpenAlexFDO

Authors Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Publication date 22 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-58747-9_9

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20) Combinatorial probability (60C05) Combinatorics of partially ordered sets (06A07)

Recommendations

• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Fast perfect sampling from linear extensions
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• Generating a random linear extension of a partial order
• Generating Linear Extensions Fast

Cites work

• scientific article; zbMATH DE number 6472598 (Why is no real title available?)
• A quantitative study of pure parallel processes
• Analytic combinatorics
• Fast perfect sampling from linear extensions
• Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time
• The Recognition of Series Parallel Digraphs

Cited in

(5)

• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• scientific article; zbMATH DE number 7524075 (Why is no real title available?)
• Beyond series-parallel concurrent systems: the case of arch processes
• On the number of increasing trees with label repetitions
• The Combinatorics of Barrier Synchronization

This page was built for publication: Entropic uniform sampling of linear extensions in series-parallel posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399366)