Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors

Authors:
Saverio Caminiti;Irene Finocchi;Rossella Petreschi
Affiliations:
Computer Science Department, Sapienza University of Rome, Rome, Italy 00198;Computer Science Department, Sapienza University of Rome, Rome, Italy 00198;Computer Science Department, Sapienza University of Rome, Rome, Italy 00198
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 14
Cited 0

Implicit representation of graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Distance labeling in graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reachability and distance queries via 2-hop labels

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Informative Labeling Schemes for Graphs

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Proximity-Preserving Labeling Schemes and Their Applications

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Labeling Schemes for Flow and Connectivity

SIAM Journal on Computing
Dynamic LCA Queries on Trees

SIAM Journal on Computing
Labeling Schemes for Small Distances in Trees

SIAM Journal on Discrete Mathematics
Compact Labeling Scheme for Ancestor Queries

SIAM Journal on Computing
On coding labeled trees

Theoretical Computer Science
Dynamic weighted ancestors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Short labels by traversal and jumping

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

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 茂戮驴(log2n)-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.