Pages that link to "Item:Q1917670"
From MaRDI portal
The following pages link to A loop-free algorithm for generating the linear extensions of a poset (Q1917670):
Displaying 19 items.
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Loopless generation of linear extensions of a poset (Q698444) (← links)
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- On the random generation and counting of weak order extensions of a poset with given class cardinalities (Q867611) (← links)
- Counting linear extensions (Q1183942) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Counting linear extensions of restricted posets (Q2215472) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- Mining posets from linear orders. (Q2874042) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Polynomial algorithms to count linear extensions in certain posets (Q3972873) (← links)
- Generating the Linear Extensions of Certain Posets by Transpositions (Q3992179) (← links)
- (Q4012810) (← links)
- (Q4591356) (← links)
- Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints (Q5001675) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- (Q5437973) (← links)
- Effective Poset Inequalities (Q6046818) (← links)