Improved algorithms for finding level ancestors in dynamic trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 73-84

  Alstrup, Stephen ^a   Holm, Jacob ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BALANCED TREES; CONSTANT TIME; DYNAMIC TREES; MINIMUM WEIGHT; PATH COMPRESSION; ROOTED TREES;

FORESTRY;

EID: 84974529357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_8     Document Type: Conference Paper

References (30)

1. S. Alstrup, A. Ben-Amram, and T. Rauhe. Worst-case and amortised optimality in union-find. In 31th ACM Symp. on Theo. of Comp., pages 499-506, 1999.
2. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In 24th Int. Col. on Auto., Lang. and Prog., volume 1256 of LNCS, pages 270-280, 1997.
3. S. Alstrup, J. Holm, and M. Thorup. Maintaining center and median in dynamic trees. In 7th Scan. Work. on Algo. Theo., LNCS, 2000.
4. S. Alstrup and M. Thorup. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. In 5th Scan. Work. on Algo. Theo., volume 1097 of LNCS, pages 212-222, 1996. To appear in J. of Algo.
5. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In 31th ACM Symp. on Theo. of Comp., pages 295-304, 1999.
6. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. on Comp., 22(2):221-242, 1993.
7. O. Berkman and U. Vishkin. Finding level-ancestors in trees. J. of Comp. and Sys. Scie., 48(2):214-230, 1994.
8. A. Buchsbaum, H. Kaplan, A. Rogers, and J. Westbrook. Linear-time pointer- machine algorithms for lca’s, mst verification, and dominators. In 30th ACM Symp. on Theo. of Comp., pages 279-288, 1998.
9. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2:337-361, 1987.
10. P. Dietz. Finding level-ancestors in dynamic trees. In 2nd Work. on Algo. and Data Struc., volume 1097 of LNCS, pages 32-40, 1991.
11. B. Dixon, M. Rauch, and R. E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. on Comp., 21(6):1184-1192, 1992.
12. M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In 21st ACM Symp. on Theory of Comp., pages 345-354, 1989.
13. M. Fredman and D. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. of Comp. and Sys. Sci., 48(3):533-551, 1994.
14. H. Gabow. A scaling algorithm for weighted matching on general graphs. In 26th Symp. on Found. of Comp. Sci., pages 90-100, 1985.
15. H. Gabow. Data structure for weighted matching and nearest common ancestors with linking. In 1st Symp. on Dis. Algo., pages 434-443, 1990.
16. H. Gabow and R. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. of Comp. and Sys. Sci., 30(2):209-221, 1985.
17. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for computational geometry. In 16th ACM Symp. on Theo. of Comp., pages 135-143, 1984.
18. D. Harel. A linear time algorithm for finding dominator in flow graphs and related problems. In 17th ACM Symp. on Theo. of Comp., pages 185-194, 1985.
19. D. Harel and R. Tarjan. Fast algorithms for finding nearest common ancestors. Siam J. on Comp., 13(2):338-355, 1984.
20. V. King. A simpler minimum spanning tree verification algorithm. Algorithmica, 18(2):263-270, 1997.
21. U. Manber. Recognizing breadth-first search trees in linear time. Information Processing Letters, 34(4):167-171, 1990.
22. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. on Comp., 17:1253-1262, 1988.
23. D. Sleator and R. Tarjan. A data structure for dynamic trees. J. of Comp. and Sys. Sci., 26(3):362-391, 1983. See also STOC 1981.
24. R. Tarjan. Applications of path compression on balanced trees. J. of the ACM, 26(4):690-715, 1979.
25. R. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. of Comp. and Sys. Sci., 18(2):110-127, 1979. See also STOC 1977.
26. M. Thorup. Parallel shortcutting of rooted trees. J. of Algo., 23(1):139-159, 1997.
27. A. Tsakalidis. The nearest common ancestor in a dynamic tree. Acta informatica, 25(1):37-54, 1988.
28. A. Tsakalidis and J. van Leeuwen. An optimal pointer machine algorithm for finding nearest common ansectors. Technical Report RUU-CS-88-17, Dep. of Comp. Sci., Uni. of Utrecht, 1988.
29. J. van Leeuwen. Finding lowest common ancestors in less than logarithmic time. Unpublish technical report, 1976.
30. A. Yao. Space-time tradeoff for answering range queries. In 14th ACM Symp. on Theo. of Comp., pages 128-136, 1982.