Average Case Analysis for Tree Labelling Schemes (2005)
| Venue: | Proc. 16th Int. Symp. on Algorithms and Computation |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Kao05averagecase,
author = {Ming-Yang Kao and Xiang-Yang Li and WeiZhao Wang},
title = {Average Case Analysis for Tree Labelling Schemes},
booktitle = {Proc. 16th Int. Symp. on Algorithms and Computation},
year = {2005},
pages = {136--145},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] proved that for any such distance labelling scheme, the maximum label length is at least 1 8 log2 n − O(log n) bits. They also gave a separatorbased labelling scheme that has the optimal label length Θ(log n · log(Hn(T))), where Hn(T) is the height of the tree. In this paper, we present two new distance labelling schemes that not only achieve the optimal label length Θ(log n · log(Hn(T))), but also have a much smaller expected label length under certain tree distributions. With these new schemes, we also can efficiently find the least common ancestor of any two vertices based on their labels only.
