The Hardness of Approximating Poset Dimension
References (15)
- et al.
Zero knowledge and the chromatic number
J. Comput. System Sci.
(1998)Complexity 96—The Eleventh Annual IEEE Conference on Computational Complexity (Philadelphia,... Dimension and algorithms
Partial orders
- et al.
Fractional dimension of partial orders
Order
(1992) A decomposition theorem for partially ordered sets
Ann. of Math. (2)
(1950)- et al.
Partially ordered sets
Amer. J. Math.
(1941) - et al.
Dimension, graph and hypergraph coloring
Order
(2000)
There are more references available in the full text version of this article.
Cited by (19)
Semi-transitive orientations and word-representable graphs
2016, Discrete Applied MathematicsGraph classes with structured neighborhoods and algorithmic applications
2013, Theoretical Computer ScienceVertex cover in graphs with locally few colors
2013, Information and ComputationThe hardness of approximating the boxicity, cubicity and threshold dimension of a graph
2010, Discrete Applied MathematicsTowards Ordinal Data Science
2023, arXiv
Copyright © 2007 Published by Elsevier B.V.