On local representation of distances in trees

Authors:
Cyril Gavoille;Arnaud Labourel
Affiliations:
LaBRI, Bordeaux, France;LaBRI, Bordeaux, France
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 4
Cited 1

Implicit representation of graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Universal graphs and induced-universal graphs

Journal of Graph Theory
Proof labeling schemes

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Labeling Schemes for Small Distances in Trees

SIAM Journal on Discrete Mathematics

Labeling schemes for vertex connectivity

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider distributed representation scheme for trees, supporting some special relationships between nodes at small distance. For instance, we show that for a tree T and an integer k we can assign local information on nodes such that we can decide for two nodes u and v if the distance between u and v is at most k and if so, compute it only using the local information assigned. For trees withn nodes, the local information assigned by our scheme is binary label of log n + O(klog(klog(n/k))) bits, improving a recent result of Alstrup, Bille and Rauhe.