We give a data structure for storing an n-element poset of width w in essentially minimal space. We then show how this data structure supports the most ...

A poset with n elements can be represented in n 2 /4 + o (n 2 ) bits [18] or in (1 + ϵ) n log n + 2nk + o(nk) bits [19] , where k is the width of the poset.

We give a data structure for storing an n -element poset of width w in essentially minimal space. We then show how this data structure supports the most ...

The output of the transitive reduction of a DAG can be considered as a poset, as it is the compact representation of the transitive closure of a DAG, which in ...

We develop a simple method of constructing topological spaces from countable posets with finite levels, one which applies to all second countable 𝖳 1 subscript ...

Aug 15, 2019 · Compact Representation of Posets. Author(s):. A. Farzan, J. Fischer. Source: Proc. 22nd International Symposium on Algorithms and Computation ...

Posets with property DINT which are compact pospaces with respect to the interval topologies are characterized. How to cite. top. MLA; BibTeX; RIS. Menon, Venu ...

We give a data structure for storing an n-element poset of width w in essentially minimal space. We then show how this data structure supports the most ...

In this paper we introduce the elementary po-triplet as a compact representation of multiple elementary triplets, by using separating posets.

• Possibly a compact representation of a lattice (exponentially good in some cases). • Work with the poset of irreducibles rather than the lattices. • Gives ...