Abstract
The purpose of this paper is to present an algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability.
| Original language | English |
|---|---|
| Pages (from-to) | 655-660 |
| Number of pages | 6 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Publication status | Published - Dec 1 2012 |
| Event | 24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 - Nagoya, Japan Duration: Jul 30 2012 → Aug 3 2012 |
Keywords
- Algorithm
- D-complete posets
- Linear extension
- Uniform generation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
- Discrete Mathematics and Combinatorics