Abstract
We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log2 n)-bit labels has been previously presented by Peleg. By engineering this scheme, we obtain a variety of data structures with the same asymptotic performances. We conduct a thorough experimental evaluation of all these data structures. Our results clearly show which variants achieve the best performances in terms of space usage, construction time, and query time. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Caminiti, S., Finocchi, I., & Petreschi, R. (2008). Engineering tree labeling schemes: A case study on least common ancestors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 234–245). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
