scientific article; zbMATH DE number 4027523

MaRDI QIDQ3768941zbMATH OpenFDO

Authors

Publication date 1986

zbMATH Keywords

information theoretic lower bound for sortingnumber of linear extensionspartially ordered setspolynomial time algorithms

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Software, source code, etc. for problems pertaining to ordered structures (06-04) Partial orders, general (06A06) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 4041286
• scientific article; zbMATH DE number 4010574
• On the computational complexity of the order polynomial
• Minimizing setups in ordered sets of fixed width
• scientific article; zbMATH DE number 1107722

Cited in

(12)

• On the computational complexity of the order polynomial
• Computing the number of mergings with constraints
• The jump number of Z-free ordered sets
• Recognition algorithms for orders of small width and graphs of small Dilworth number
• Linear extensions of N-free orders.
• Linear extension numbers of \(n\)-element posets
• Extending partial suborders
• Effective extensions of partial orders
• scientific article; zbMATH DE number 4041286 (Why is no real title available?)
• The Complexity of the Extendibility Problem for Finite Posets
• scientific article; zbMATH DE number 5592511 (Why is no real title available?)
• Finding the largest suborder of fixed width

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 Q3768941)