论文信息 - Compact Representation of Posets

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.

Johannes Fischer | Arash Farzan

[1] Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[2] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[3] J. Ian Munro,et al. Succinct Representations of Arbitrary Graphs , 2008, ESA.

[4] Rajeev Raman,et al. Succinct Representations of Permutations , 2003, ICALP.

[5] Kurt Mehlhorn,et al. Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings , 2008, ESA.

[6] Gerald L. Thompson,et al. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph , 1969, J. ACM.

[7] Elchanan Mossel,et al. Sorting and Selection in Posets , 2007, SIAM J. Comput..

[8] Maurizio Talamo,et al. An Efficient Data Structure for Lattice Operations , 1999, SIAM J. Comput..

[9] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[10] G. Brightwell,et al. The number of partial orders of fixed width , 1996 .

[11] Deepak Dhar. Entropy and phase transitions in partially ordered sets , 1978 .

[12] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..