Compact labeling schemes for ancestor queries

@inproceedings{Abiteboul2001CompactLS,
  title={Compact labeling schemes for ancestor queries},
  author={Serge Abiteboul and Haim Kaplan and Tova Milo},
  booktitle={SODA},
  year={2001}
}
We consider the following problem. Give a rooted tree T, label the nodes of T in the most compact way such that given the labels of two nodes one can determine in constant time, by looking only at the labels, if one node is an ancestor of the other. The best known labeling scheme is rather straightforward and uses labels of size at most 2 log n, where n is the number of vertices In the tree. Our main result in this paper is a labeling scheme with maximum label size close to 3/2 log n. Our… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 192 citations. REVIEW CITATIONS

Topics

Statistics

01020'02'04'06'08'10'12'14'16'18
Citations per Year

192 Citations

Semantic Scholar estimates that this publication has 192 citations based on the available data.

See our FAQ for additional information.