Compact representation of posets

Authors:
Arash Farzan;Johannes Fischer
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 7
Cited 1

An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Journal of the ACM (JACM)
An Efficient Data Structure for Lattice Operations

SIAM Journal on Computing
Succinct Representation of Balanced Parentheses and Static Trees

SIAM Journal on Computing
Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM (JACM)
Succinct Representations of Arbitrary Graphs

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Succinct representations of permutations

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sorting and Selection in Posets

SIAM Journal on Computing

Succinct posets

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.