Elsevier

Theoretical Computer Science

Volume 70, Issue 2, 26 January 1990, Pages 251-260
Theoretical Computer Science

Note
On locally presented posets

https://doi.org/10.1016/0304-3975(90)90125-2Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, the concept of local presentability of posets is introduced, together with the related notion of boolean dimension, as an extension of the classic Dushnik-Miller dimension. Such a concept seems to represent a powerful tool for the efficient encoding of poset and transitive closure of dags, from the point of view of both space and time complexity. Encodings of some classes of posets are presented as an application of the theory: in particular, an efficient encoding of a subclass of the class of planar dags is introduced.

Cited by (0)