Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

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

Volumn 1097, Issue , 1996, Pages 212-222

  Alstrup, Stephen ^a   Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DYNAMIC TREES; HOPCROFT; LOWER BOUNDS; POINTER MACHINES; ROOTED TREES; TREE ROOT;

FORESTRY;

EID: 84947927922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_133     Document Type: Conference Paper

References (12)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. On finding lowest common ancestor in trees. SIAM Journal on computing, 5(1):115-132, 1976. See also STOC 1973.
3. S. Alstrup. Optimal algorithms for finding nearest common ancestors in dynamic trees. Technical Report 95-30, Department of Computer Science, University of Copenhagen, 1995.
4. H.N. Gabow. Data structure for weighted matching and nearest common ancestors with linking. In Annual ACM-SIAM Symposium on discrete algorithms (SODA), volume 1, pages 434-443, 1990.
5. H.N. Gabow and R.E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of computer and system sciences, 30(2):209-221, 1985.
6. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. Siam J. Comput, 13(2):338-355, 1984.
7. D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. Journal of computer and system sciences, 26(3):362-391, 1983. See also STOC 1981.
8. R.E. Tarjan. Applications of path compression on balanced trees. Journal of the association for computing machinery (J.ACM), 26(4):690-715, 1979.
9. R.E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of computer and system sciences, 18(2): 110-127, 1979.
10. A.K. Tsakalides and J. van Leeuwen. An optimal pointer machine algorithm for finding nearest common ansectors. Technical Report RUU-CS-88-17, Department of Computer Science, University of Utrecht, 1988.
11. A.K. Tsakalidis. The nearest common ancestor in a dynamic tree. Acta informatica, 25(1):37-54, 1988.
12. J. van Leeuwen. Finding lowest common ancestors in less than logarithmic time. Unpublish technical report, 1976.