The Complexity of the Partial Order Dimension Problem
- 1 September 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (3) , 351-358
- https://doi.org/10.1137/0603036
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Sufficient Conditions for Graphs to Have Threshold Number 2Published by Elsevier ,1981
- The 3-Irreducible Partially Ordered SetsCanadian Journal of Mathematics, 1977
- Aggregation of Inequalities in Integer ProgrammingPublished by Elsevier ,1977
- Characterization problems for graphs, partially ordered sets, lattices, and families of setsDiscrete Mathematics, 1976
- On the complexity of posetsDiscrete Mathematics, 1976
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Intransitive indifference with unequal indifference intervalsJournal of Mathematical Psychology, 1970
- Theory of GraphsPublished by American Mathematical Society (AMS) ,1962
- Partially Ordered SetsAmerican Journal of Mathematics, 1941