Entropic uniform sampling of linear extensions in series-parallel posets

DOI10.1007/978-3-319-58747-9_9zbMath1489.68174OpenAlexW4302087352MaRDI QIDQ2399366

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

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) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Randomized algorithms (68W20)

Related Items (5)

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 ⋮ The Combinatorics of Barrier Synchronization ⋮ Beyond series-parallel concurrent systems: the case of arch processes ⋮ Unnamed Item

Cites Work

• A quantitative study of pure parallel processes
• Fast perfect sampling from linear extensions
• The Recognition of Series Parallel Digraphs
• Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
• Unnamed Item
• Unnamed Item

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