Compact Representation of Posets
Compact Representation of Posets
复制标题
集合的紧凑表示
DOI:
10.1007/978-3-642-25591-5_32
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
J. Fischer
中科院分区:
文献类型:
--
作者:
Arash Farzan;J. Fischer
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.