On recognizing the dimension of a poset

MaRDI QIDQ1293056zbMATH OpenFDO

Authors Bayoumi I. Bayoumi, Mohamed H. El-Zahar, Soheir M. Khamis

Publication date 21 November 1999

Published in Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

algorithmlinear extensionsproblem complexitydimension of a posetunlabeled posets3-dimensional posetsnumber of critical incomparable pairs

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07)

Recommendations

• A Poset Dimension Algorithm
• The Hardness of Approximating Poset Dimension
• The complexity of the partial order dimension problem: closing the gap
• A recognition algorithm for orders of interval dimension two

Cited in

(8)

• The complexity of the partial order dimension problem: closing the gap
• A counting of the minimal realizations of the posets of dimension two.
• scientific article; zbMATH DE number 3999988 (Why is no real title available?)
• Dimension of CPT posets
• Posets with large dimension and relatively few critical pairs
• Recognition of prime posets and one of its applications
• On the recognition of neighborhood inclusion posets
• A note on the dimension of a poset

This page was built for publication: On recognizing the dimension of a poset

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