Entropic uniform sampling of linear extensions in series-parallel posets

DOI10.1007/978-3-319-58747-9_9zbMATH Open1489.68174OpenAlexW4302087352MaRDI QIDQ2399366FDOQ2399366

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

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

Mathematics Subject Classification ID

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

Cites Work

• Analytic combinatorics
• The Recognition of Series Parallel Digraphs
• Fast perfect sampling from linear extensions
• A quantitative study of pure parallel processes
• Title not available (Why is that?)
• Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time

Cited In (5)

• Title not available (Why is that?)
• Beyond series-parallel concurrent systems: the case of arch processes
• The Combinatorics of Barrier Synchronization
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• On the number of increasing trees with label repetitions

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)