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.3071
An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probabilityConference paper

Authors: Kento Nakada 1,2

[en]
\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

[fr]
Le but de ce papier est prèsenter un algorithme qui produit des extensions linèaires pour une non-simply-laced d-complete poset avec probabilitè constante.

https://doi.org/10.46298/dmtcs.3071
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: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] d-complete posets, algorithm, linear extension, uniform generation

Share and export

Consultation statistics

This page has been seen 345 times.
This article's PDF has been downloaded 425 times.