scientific article; zbMATH DE number 16221

MaRDI QIDQ3972873zbMATH OpenFDO

Authors George Steiner

Publication date 26 June 1992

zbMATH Keywords

dynamic programming algorithmlinear extensionposetstrees

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Dynamic programming (90C39)

Recommendations

• Generating Linear Extensions Fast
• A loop-free algorithm for generating the linear extensions of a poset
• A faster tree-decomposition based algorithm for counting linear extensions
• A faster tree-decomposition based algorithm for counting linear extensions
• Counting linear extensions

Cited in

(16)

• Using TPA to count linear extensions
• A polynomial time algorithm for the 2-poset cover problem
• The bounds for the number of linear extensions via chain and antichain coverings
• Linear extensions of N-free orders.
• scientific article; zbMATH DE number 4041286 (Why is no real title available?)
• scientific article; zbMATH DE number 14735 (Why is no real title available?)
• Computing linear extensions for polynomial posets subject to algebraic constraints
• A faster tree-decomposition based algorithm for counting linear extensions
• Extended strict order polynomial of a poset and fixed elements of linear extensions
• Linear extensions of diamond posets
• A recurrence for linear extensions
• Counting linear extensions of posets with determinants of hook lengths
• A polynomially solvable case of optimal linear extension problem of a poset
• Loopless generation of linear extensions of a poset
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
• A faster tree-decomposition based algorithm for counting linear extensions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972873)