On recognizing the dimension of a poset

zbMATH Open0934.06006MaRDI QIDQ1293056FDOQ1293056

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)

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

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)

Cited In (8)

• Posets with large dimension and relatively few critical pairs
• Recognition of prime posets and one of its applications
• A counting of the minimal realizations of the posets of dimension two.
• Title not available (Why is that?)
• The complexity of the partial order dimension problem: closing the gap
• Dimension of CPT posets
• A note on the dimension of a poset
• On the recognition of neighborhood inclusion posets

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)