Compact Representation of Posets
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 interesting queries on posets in either constant time, or in time that depends only on w and the size of the in-/output, but not on n. Our results also have direct applicability to DAGs of low width.
KeywordsDirected Acyclic Graph Transitive Closure Compact Representation Arbitrary Graph Transitive Reduction
Unable to display preview. Download preview PDF.