 |
Discrete Mathematics & Theoretical Computer Science |
Kento Nakada - An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
dmtcs:3071 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3071An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probabilityArticle
- 1 Wakkanai Hokusei Gakuen University
- 2 Okayama University
\textbfAbstract. 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. ≠wline
Source: HAL:hal-01283096v1
Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: d-complete posets, algorithm, linear extension, uniform generation,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Consultation statistics
This page has been seen 235 times.
This article's PDF has been downloaded 252 times.