Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. An algorithm which g ...
Conference paper

An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability

Kento Nakada (1) (2)
(1) Wakkanai Hokusei Gakuen University
(2) Okayama University
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3071
License
https://about.hal.science/hal-authorisation-v1
Indicators
495
Views
563
Downloads

An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability

Kento Nakada (1) (2)
(1) Wakkanai Hokusei Gakuen University
(2) Okayama University
Abstract
English
\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
French
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • d-complete posets
  • algorithm
  • linear extension
  • uniform generation
Preview
Loading PDF preview...