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

Research output: Contribution to journalConference article

Abstract

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.

Original languageEnglish
Pages (from-to)655-660
Number of pages6
JournalDiscrete Mathematics and Theoretical Computer Science
Publication statusPublished - Dec 1 2012
Event24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 - Nagoya, Japan
Duration: Jul 30 2012Aug 3 2012

Keywords

  • Algorithm
  • D-complete posets
  • Linear extension
  • Uniform generation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability'. Together they form a unique fingerprint.

  • Cite this