Nearest common ancestors: A survey and a new distributed algorithm

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 258-264

  Alstrup, Stephen ^a   Gavoille, Cyril ^b   Kaplan, Haim ^c   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; SEARCH ENGINES; THEOREM PROVING; XML;

COMPLETE BINARY TREES; DISTRIBUTED ALGORITHM;

ALGORITHMS;

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

References (45)

1. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In 12th Annual ACM Symposium on Discrete Algorithms (SODA), pages 547-556, 2001.
2. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing, 10(3):405-421, 1981.
3. 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.
4. S. Alstrup and J. Holm. Improved algorithms for finding level ancestors in dynamic trees. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of LNCS, pages 73-84, Springer-Verlag, 2000.
5. S. Alstrup and T. Rauhe. Labeling scheme lower bounds for ancestor, silbing and connectivity. Technical Report TR-2001-10, IT University of Copenhagen, 2001.
6. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In 13th Annual ACM Symposium on Discrete Algorithms (SODA), 2002.
7. S. Alstrup and M. Thorup. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. Journal of Algorithms, 35(2):169-188, 2000.
8. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM Journal on Computing, 22(2):221-242, 1993.
9. S. Carlsson and B. J. Nilsson. Computing vision points in polygons. Algorithmica, 24(1):50-75, 1999.
10. S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science, 203(2):205-223, August 1998.
11. R. Cole and R. Hariharan. Dynamic lca queries on trees. In 10th Annual ACM Symposium on Discrete Algorithms (SODA), 1999.
12. L. J. Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38:170-183, 2001.
13. P. F. Dietz. Finding level-ancestors in dynamic trees. In 2nd Work. on Algo. and Data Struct., volume 1097 of LNCS, pages 32-40, 1991.
14. B. Dixon, M. Rauch, and R. E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing, 21(6):1184-1192, 1992.
15. T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor. In 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11-20, August 1998.
16. M. Farach-Colton. Optimal suffix tree construction with large alphabets. In 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 137-143, 1997.
17. M. Farach-Colton, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1/2):155-179, 1995.
18. P. Fraigniaud and C. Gavoille. Routing in trees. In 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of LNCS, pages 757-772, 2001.
19. G. N. Frederickson and R. Janardan. Separator-based strategies for efficient message routing. In 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 428-437, October 1986.
20. G. N. Frederickson and R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164-181, February 1990.
21. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O (1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
22. H. N. Gabow. Data structure for weighted matching and nearest common ancestors with linking. In 1st Annual ACM Symposium on Discrete Algorithms (SODA), pages 434-443, 1990.
23. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In 16th Annual ACM Symposium on Theory of Computing (STOC), pages 135-143, 1984.
24. E. N. Gilbert and E. F. Moore. Variable-length binary encodings. Technical report, Bell System Technical Journal, 1959.
25. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
26. D. Harel. A linear time algorithm for the lowest common ancestors problem (extended abstract). In 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 308-319, 1980.
27. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal Computing, 13(2):338-355, 1984.
28. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. SIAM Journal on Discrete Mathematic, 5(4):596-603, 1992. Preliminary version appeared in STOC 1988.
29. H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In 7th International Workshop on Algorithms and Data Structures (WADS), volume 2125 of LNCS, pages 32-40, Springer, August 2001.
30. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42(2):321-328, 1995.
31. V. King. private communication, July 1999.
32. Janos Komlos. Linear verification for spanning trees. Combinatorica, pages 57-65, 1985.
33. M. Farach-Colton, M. A. Bender. The LCA problem revisted. In 4th LATIN, pages 88-94, 2000.
34. D. Maier. A space efficient method for the lowest common ancestor problem and an application to finding negative cycles. In 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 132-141, 1977.
35. 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.
36. R. Pagh. Faster deterministic dictionaries. In 11th Annual ACM Symposium on Discrete Algorithms (SODA), pages 487-49, 2000.
37. D. Peleg. Proximity-preserving labeling schemes and their applications. In 25th International Workshop, Graph-Theoretic Concepts in Computer Science (WG), volume 1665 of LNCS, pages 30-41, 1999.
38. D. Peleg. Informative labeling schemes for graphs. In 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1893 of LNCS, pages 579-588. Springer, August 2000.
39. P. Powell. A further improved LCA algorithm. Technical Report TR90-01, University of Minneapolis, 1990.
40. N. Santoro and R. Khatib. Labeling and implicit routing in networds. The Computer Journal, 28:5-8, 1985.
41. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal of Computing, 17:1253-1262, 1988.
42. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, June 1972.
43. M. Thorup and U. Zwick. Compact routing schemes. In 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001.
44. J. Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, 1980.
45. J. Westbrook. Fast incremental planarity testing. In Werner Kuich, editor, 19th International Colloquium on Automata, Languages and Programming (ICALP), volume 623 of LNCS, pages 342-353. Springer-Verlag, 1992.