Sciweavers

116
Voted
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Average Case Analysis for Tree Labelling Schemes
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] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang