Improved labeling scheme for ancestor queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 947-953

  Alstrup, Stephen ^a   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; SEARCH ENGINES;

BINARY STRING; CONSTANT TIME; LABELING SCHEME; ROOTED TREES;

BINARY TREES;

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

References (21)

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. Finding nearest common ancestors in a distributed enviroment. Technical Report 2001-6, IT-University of Copenhagen, 2001.
3. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In Automata, Languages and Programming, 24th International Colloquium, volume 1256 of Lecture Notes in Computer Science, pages 270-280. Springer-Verlag, 7-11 July 1997.
4. S. Alstrup, J. Holm, and M. Thorup. Maintaining median and center in dynamic trees. In 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of Lecture Notes in Computer Science, pages 46-56. Springer-Verlag, 2000
5. S. Alstrup and T. Rauhe, January 2001. Personal communication at SODA'01.
6. G. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning tree. SIAM J. Computing, 26(2):484-538, 1997. See also FOCS'91.
7. C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In 12th Symp. On Discrete algorithms, 2001.
8. E. N. Gilbert and E. F. Moore. Variable-length binary encodings. Technical report, Bell System Technical Journal, 1959. Vol. 38, pp. 933-967.
9. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. SIAM J. DISC. MATH., 1992. Preliminary version appeared in STOC'88.
10. H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In 7nd Work, on Algo. and Data Struc, LNCS, 2001.
11. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In Proceedings of the thirteen annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
12. M. Katz, N. Katz, and D. Peleg. Distance labeling schemes for well-seperated graph classes. In STACS'00, volume 1170 of LNCS. Springer Verlag, 2000.
13. M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In Proceedings of the thirteen annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
14. K. Mehlhorn. A best possible bound for the weighted path lenght of binary search trees. SIAM Journal on Computing, 6(2):235-239, June 1977
15. S. Olesen. Labeling in trees. Master's thesis, IT-Unversity of Copenhagen, 2001.
16. D. Peleg. Proximity-preserving labeling schemes and their applications. In Graph-Theoretic concepts in computer science, 25th international workshop WG'99, volume 1665 of LNCS, pages 30-41. Springer Verlag, 1999.
17. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The computer J., 28:5-8, 1985.
18. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
19. M. Thorup and U. Zwick. Compact routing schemes. In ACM Symposium on Parallel Algorithms and Architectures, volume 13, 2001.
20. A. K-Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101-112, 1984.
21. Extensible markup languange (xml) 1.0. http://www.w3.org/TR/REC-xml