scientific article; zbMATH DE number 1554930

MaRDI QIDQ4525259zbMATH OpenFDO

Authors

Publication date 21 January 2001

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Nonnumerical algorithms (68W05)

Recommendations

• The complexity of the partial order dimension problem: closing the gap
• scientific article; zbMATH DE number 736305
• Dimension versus size
• A Poset Dimension Algorithm
• A recognition algorithm for orders of interval dimension two

Cited in

(10)

• Edge subdivision and dimension
• On building the transitive reduction of a two-dimensional poset
• Computing a poset from its realizer
• The complexity of the partial order dimension problem: closing the gap
• The Hardness of Approximating Poset Dimension
• A Poset Dimension Algorithm
• The computational complexity of rationalizing Pareto optimal choice behavior
• Order dimension of layered generalized crowns.
• The complexity of embedding orders into small products of chains
• A compact data structure and parallel algorithms for permutation graphs

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