Embedding Partially Ordered Sets intoChain -

@inproceedings{Habib1995EmbeddingPO,
  title={Embedding Partially Ordered Sets intoChain -},
  author={P. Habib and Marianne Huchard and Lhouari NourineD},
  year={1995}
}
Embedding partially ordered sets into chain-products is already known to be NP-complete (see Yannakakis 30] for dimension or Stahl and Wille 26] for 2-dimension). In this paper, we introduce a new dimension parameter and show that encoding using terms (or k-dimension) is not better than bit-vector (or 2-dimension) and vice versa. A decomposition theory is introduced using coatomic lattices. An algorithm is provided to compute the associated decomposition tree. Such a tree is unique for a… CONTINUE READING
13 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Managing Complex Objects. PhD thesis, University of Queensland, in preparation, PHD thesis

  • Gerard Ellis
  • 1995
Highly Influential
8 Excerpts

Codages et dimensions de relations binaires

  • A. Bouchet
  • Annals of Discrete Math ematics 23, Ordres…
  • 1984
Highly Influential
7 Excerpts

Embedding two dimensional posets

  • C. De La Higuera, L. Nourine
  • Research report,
  • 1995
Highly Influential
8 Excerpts

A linear time algorithm to recognize distributive lat tices

  • M. Habib, L. Nourine
  • Research Report 92-012, to appear in Order, LIRMM…
  • 1993
Highly Influential
8 Excerpts

Incidence structure, coding and lattice of maximal antichains

  • M. Habib, M. Morvan, M. Pouzet, J.-X. Rampon
  • Technial report.,
  • 1991
Highly Influential
4 Excerpts

E cient management of tran sitive relationships in large data bases, including is-a hierarchies

  • Rakesh Agrawal, Alex Borgida, H. V. Jagadish
  • ACM SIGMOD
  • 1989
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…