An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
Kento Nakada · Discrete Mathematics & Theoretical Computer Science · 2012
\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 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.