The Level Ancestor Problem simplified

Theoretical Computer Science

Volumn 321, Issue 1, 2004, Pages 5-12

  Bender, Michael A ^a   Farach Colton, Martín ^b  

^a Stony Brook University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Data structures; Level Ancestor Problem; Rooted trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; OPTIMIZATION; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS);

LEVEL ANCESTOR PROBLEM; PREPROCESSING TIME; QUERY TIME; ROOTED TREES;

PROBLEM SOLVING;

EID: 2442516025     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.05.002     Document Type: Conference Paper

References (5)

1. S. Alstrup, J. Holm, Improved algorithms for finding level-ancestors in dynamic trees, in: 27th Internat. Colloquium on Automata, Languages and Programming (ICALP), Geneva, Switzerland, Lecture Notes in Comput. Sci. Vol. 1853, Springer, Berlin, 2000, pp. 73-84.
2. M.A. Bender, E. Demaine, M. Farach-Colton, Cache-oblivious B-trees, in: 41st Annual Symp. on Foundations of Computer Science (FOCS), 2000, pp. 399-409.
3. Berkman O., Vishkin U. Finding level-ancestors in trees. J. Comput. System Sci. 48(2):1994;214-230.
4. P.F. Dietz, Finding level-ancestors in dynamic trees, in: Workshop on Algorithms and Data Structures (WADS), Ottawa, Canada, 1991, pp. 32-40.
5. Gabow H.N., Tarjan R.E. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci. 30(2):1985;209-221.