Pages that link to "Item:Q3972873"
From MaRDI portal
The following pages link to Polynomial algorithms to count linear extensions in certain posets (Q3972873):
Displaying 12 items.
- A recurrence for linear extensions (Q583247) (← links)
- A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
- Loopless generation of linear extensions of a poset (Q698444) (← links)
- Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice (Q722587) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- A polynomial time algorithm for the 2-poset cover problem (Q2032144) (← links)
- Linear extensions of N-free orders. (Q2351714) (← links)
- (Q3977200) (← 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)