Geodesic
An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) (2012).

Voir la notice de l'article provenant de la source Episciences

\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 
@article{DMTCS_2012_special_263_a57,
     author = {Nakada, Kento},
     title = {An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)},
     year = {2012},
     doi = {10.46298/dmtcs.3071},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3071/}
}
TY  - JOUR
AU  - Nakada, Kento
TI  - An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
JO  - Discrete mathematics & theoretical computer science
PY  - 2012
VL  - DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3071/
DO  - 10.46298/dmtcs.3071
LA  - en
ID  - DMTCS_2012_special_263_a57
ER  - 
%0 Journal Article
%A Nakada, Kento
%T An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
%J Discrete mathematics & theoretical computer science
%D 2012
%V DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3071/
%R 10.46298/dmtcs.3071
%G en
%F DMTCS_2012_special_263_a57
Nakada, Kento. An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) (2012). doi : 10.46298/dmtcs.3071. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3071/

Cité par Sources :