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 \over 8} {\rm log}^{2} n - O({\rm log} n)\) bits. They also gave a separator-based labelling scheme that has the optimal label length \({\it \Theta}({\rm log} {n} \cdot {\rm log}(H_{n}(T)))\), where H n (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 \({\it \Theta}({\rm log} n \cdot {\rm log} (H_{n}(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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 689–698 (2003)
Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: SPAA 2002 (2002)
Alstrup, S., Rauhe, T.: Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries. Tech. Report IT-C, nr. 10, IT University of Copenhagen (2001)
Alstrup, S., Rauhe, T.: Small induced universal graphs and compact implicit graph representations. In: IEEE FOCS (2002)
Breuer, M.A.: Coding the vertexes of a graph. IEEE Transactions on Information Theory 12, 148–153 (1966)
Breuer, M.A., Folkman, J.: An unexpected result on coding the vertices of a graph. Journal of Mathematical Analysis and Applications 20, 583–600 (1967)
Gavoille, S.P.C., Peleg, D., Raz, R.: Distance labeling in graphs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete algorithms, pp. 210–219 (2001)
Flajolet, P., Odlyzko, A.: The average height of binary trees and other simple trees. Journal of Computer and System Sciences 25, 171–213 (1982)
Gavoille, C., Katz, M., Katz, N., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476–488. Springer, Heidelberg (2001)
Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distrib. Comput. 16, 111–120 (2003)
Kao, M.-Y.: Tree contractions and evolutionary trees. SIAM Journal on Computing 27, 1592–1616 (1998)
Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30–41. Springer, Heidelberg (1999)
Reed, B.: The height of a random binary search tree. Journal of ACM 50, 306–332 (2003)
Kannan, M.N.S., Rudich, S.: Implicit representation of graphs. In: Proceedings of the Twentieth annual ACM symposium on Theory of computing, pp. 334–343. ACM Press, New York (1988)
Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2000)
Kao, M.-Y., Li, X.-Y., Wang, W.: Average Case Analysis for Tree Labelling Schemes. Full veresion of the paper is available at, http://www.cs.iit.edu/~xli/publications-select.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kao, MY., Li, XY., Wang, W. (2005). Average Case Analysis for Tree Labelling Schemes. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_15
Download citation
DOI: https://doi.org/10.1007/11602613_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)