scientific article; zbMATH DE number 16221

zbMATH Open0747.06001MaRDI QIDQ3972873FDOQ3972873

Authors: George Steiner 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

treesdynamic programming algorithmposetslinear extension

Mathematics Subject Classification ID

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

Cited In (14)

• A polynomially solvable case of optimal linear extension problem of a poset
• A recurrence for linear extensions
• Title not available (Why is that?)
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
• Linear extensions of N-free orders.
• Linear extensions of diamond posets
• A polynomial time algorithm for the 2-poset cover problem
• Title not available (Why is that?)
• Computing linear extensions for polynomial posets subject to algebraic constraints
• Counting linear extensions of posets with determinants of hook lengths
• A faster tree-decomposition based algorithm for counting linear extensions
• A faster tree-decomposition based algorithm for counting linear extensions
• Loopless generation of linear extensions of a poset
• Using TPA to count 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)