Abstract
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the operations: insert; delete; test membership; and predecessor. The performance of our data structure is within an O(logw)-factor of optimal. Here w ≤ n is the width of the partial - order - a natural obstacle in searching a partial order. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Heeringa, B., Iordan, M. C., & Theran, L. (2011). Searching in dynamic tree-like partial orders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 512–523). https://doi.org/10.1007/978-3-642-22300-6_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
