Labeling schemes for small distances in trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 689-698

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

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DECODING; ENCODING (SYMBOLS); RANDOM ACCESS STORAGE; THEOREM PROVING;

LABELING SCHEMES; SMALL DISTANCES; TREES;

GRAPH THEORY;

EID: 0038754085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In Proceedings of the twelfth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 547-556, 2001.
2. S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe. Nearest common ancestors : A survey and a new distributed algorithm. In In Proceedings of the fourteenth annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), 2002.
3. S. Alstrup and T. Rauhe. Improved labeling schemes for ancestor queries. In Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
4. S. Alstrup and T. Rauhe. Small induced universal graphs and compact implicit graph representations. In Proceedings of the fourtythird annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002.
5. M. A. Breuer. Coding vertexes of a graph. IEEE Transactions on Information Theory, IT-12:148-153, 1966.
6. M. A. Breuer and J. Folkman. An unexpected result on coding vertices of a graph. Journal of Mathematical Analysis and Applications, 20:583-600, 1967.
7. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
8. E. Cohen, H. Kaplan, and T. Milo. Labeling dynamic xml trees. In Proceedings of the twentyfirst annual ACM Symposium on Principles of Database Systems (PODS), 2002.
9. R. Diestel. Graph Theory. Springer-Verlag, 2000.
10. C. Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In Proceedings of the ninth annual European Symposium on Algorithms (ESA), volume 2161 of LNCS, pages 476-488. Springer Verlag, 2001.
11. C. Gavoille and C. Paul. Split decomposition and distance labeling: an optimal scheme for distance hereditary graphs. In Proceedings of the ninth European Conference on Combinatorics, Graph Theory and Applications, 2001.
12. C. Gavoille and D. Peleg. Compact and localized distributed data structures. Technical Report RR-1261-01, Laboratoire Bordelais de Recherce en Informatique, 2001.
13. C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In Proceedings of the twelfth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001.
14. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13(2):338-355, 1984.
15. D. A. Huffman. A methode for construction of minimum-redundancy codes. Proceedings of the IRE, 1952.
16. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In Proceedings of twentieth annual ACM-SIAM Symposium On Theory of Computing (STOC), 1988.
17. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 1992. Preliminary version appeared in STOC'88.
18. H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In Proceeding of the seventh Workshop on Algorithms and Data Structures, LNCS, 2001.
19. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
20. M. Katz, N. Katz, and D. Peleg. Distance labeling schemes for well-separated graph classes. In Proceedings of the seventeenth Symposium on Theoretical Aspects of Computer Science (STACS), volume 1170 of LNCS. Springer-Verlag, 2000.
21. M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
22. D. Peleg. Proximity-preserving labeling schemes and their applications. In Graph-Theoretic Concepts in Computer Science, twentyfifth international workshop, volume 1665 of LNCS, pages 30-41. Springer Verlag, 1999.
23. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The computer Journal, 28:5-8, 1985.
24. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
25. M. Thorup and U. Zwick. Approximate distance oracles. In In Proceedings of the thirteenth annual ACM-SIAM Symposium on Theory of Computing (STOC), pages 1-10, 2001.
26. M. Thorup and U. Zwick. Compact routing schemes. In In Proceedings of the thirteenth annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), volume 13, 2001.
27. A. K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101-112, 1984.