scientific article

DOI10.4086/cjtcs.2014.003zbMath1372.68293OpenAlexW4243832079MaRDI QIDQ3191146

Mark L. Huber

Publication date: 24 September 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2014.003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear extensionsperfect simulationcorrugated surfaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Counting linear extensions of restricted posets ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset

Cites Work

• Unnamed Item
• Unnamed Item
• Generating a random linear extension of a partial order
• On the conductance of order Markov chains
• Counting linear extensions
• Faster random generation of linear extensions
• Mixing times of lozenge tiling and card shuffling Markov chains
• Fast perfect sampling from linear extensions

This page was built for publication: