Labeling schemes for small distances in trees

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 2, 2005, Pages 448-462

  Alstrup, Stephen ^a   Bille, Philip ^a   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Labeling schemes; Trees

Indexed keywords

COMPUTATION THEORY; NUMBER THEORY; NUMERICAL METHODS; TREES (MATHEMATICS);

LABELING SCHEMES;

NUMBERING SYSTEMS;

EID: 33646846610     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103433409     Document Type: Article

References (27)

1. S. ABITEBOUL, H. KAPLAN, AND T. MILO, Compact labeling schemes for ancestor queries, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 547-556.
2. S. ALSTRUP, C. GAVOILLE, H. KAPLAN, AND T. RAUHE, Nearest common ancestors: A survey and a new distributed algorithm, in Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architecture, 2002.
3. S. ALSTRUP AND T. RAUHE, Improved labeling schemes for ancestor queries, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
4. S. ALSTRUP AND T. RAUHE, Small induced universal graphs and compact implicit graph representations, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.
5. M. A. BREUER, Coding vertexes of a graph, IEEE Trans. Inform. Theory, 12 (1966), pp. 148-153.
6. M. A. BREUER AND J. FOLKMAN, An unexpected result on coding vertices of a graph, J. Math. Anal. Appl., 20 (1967), pp. 583-600.
7. E. COHEN, E. HALPERIN, H. KAPLAN, AND U. ZWICK, Reachability and distance queries via 2-hop labels, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
8. E. COHEN, H. KAPLAN, AND T. MILO, Labeling dynamic XML trees, in Proceedings of the 21st Annual ACM Symposium on Principles of Database Systems, 2002.
9. R. DIESTEL, Graph Theory, Springer-Verlag, New York, 2000.
10. C. GAVOILLE, M. KATZ, N. KATZ, C. PAUL, AND D. PELEG, Approximate distance labeling schemes, in Proceedings of the 9th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2161, Springer-Verlag, New York, 2001, pp. 476-488.
11. C. GAVOILLE AND C. PAUL, Split decomposition and distance labeling: An optimal scheme for distance hereditary graphs, in Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications, 2001.
12. C. GAVOILLE AND D. PELEG, Compact and localized distributed data structures, Distributed Computing, 16 (2003), pp. 111-120.
13. C. GAVOILLE, D. PELEG, S. PERENNES, AND R. RAZ, Distance labeling in graphs, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001.
14. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
15. D. A. HUFFMAN, A method for construction of minimum-redundancy codes, in Proceedings of the Institute of Radio Engineers, 1952.
16. S. KANNAN, M. NAOR, AND S. RUDICH, Implicit representation of graphs, in Proceedings of 20th Annual ACM Symposium on Theory of Computing, 1988.
17. S. KANNAN, M. NAOR, AND S. RUDICH, Implicit representation of graphs, SIAM J. Discrete Math., 5 (1992), pp. 596-603.
18. H. KAPLAN AND T. MILO, Short and simple labels for small distances and other functions, in Proceedings of the 7th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 2125, Springer-Verlag, New York, 2001.
19. H. KAPLAN, T. MILO, AND R. SHABO, A comparison of labeling schemes for ancestor queries, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
20. M. KATZ, N. KATZ, AND D. PELEG, Distance labeling schemes for well-separated graph classes, in Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1170, Springer-Verlag, New York, 2000.
21. M. KATZ, N. A. KATZ, A. KORMAN, AND D. PELEG, Labeling schemes for flow and connectivity, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
22. D. PELEG, Proximity-preserving labeling schemes and their applications, in Graph-Theoretic Concepts in Computer Science, 25th International Workshop, Lecture Notes in Comput. Sci. 1665, Springer-Verlag, New York, 1999, pp. 30-41.
23. N. SANTORO AND R. KHATIB, Labeling and implicit routing in networks, Comput. J., 28 (1985), pp. 5-8.
24. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
25. M. THORUP AND U. ZWICK, Approximate distance oracles, in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 2001, pp. 1-10.
26. M. THORUP AND U. ZWICK, Compact routing schemes, in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architecture, Vol. 13, 2001.
27. A. K. TSAKALIDIS, Maintaining order in a generalized linked list, Acta Inform., 21 (1984), pp. 101-112.