Nearest common ancestors: A survey and a new algorithm for a distributed environment

Theory of Computing Systems

Volumn 37, Issue 3, 2004, Pages 441-456

  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

BOUNDED TREE-WIDTH ALGORITHMS; DISTRIBUTED ENVIRONMENTS; LINEAR TIME ALGORITHMS; ROUTING;

COMPUTER NETWORKS; DATA STRUCTURES; NUMERICAL METHODS; PROBLEM SOLVING; ROUTERS; SET THEORY;

ALGORITHMS;

EID: 7444235539     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1155-5     Document Type: Article

References (73)

1. th Annual ACM Symposium on Discrete Algorithms (SODA), pages 547-556, 2001.
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 Proc. STOC 1973
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 Proc. STOC 1973
4. . [3] 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.
5. st Annual ACM Symposium on Theory Computing (STOC), pages 499-506, 1999.
6. th Symposium on Discrete Algorithms (SODA), pages 689-698, January 2003.
7. th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of LNCS, pages 73-84. Springer-Verlag, Berlin, 2000.
8. th Annual ACM Symposium on Discrete Algorithms (SODA), pages 947-953, 2002.
9. S. Alstrup and M. Thorup. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. Journal of Algorithms, 35(2):169-188, 2000.
10. th LATIN, pages 88-94, 2000.
11. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 845-854, 2001.
12. st Annual ACM Symposium on Theory of Computing (STOC), pages 309-319, 1989.
13. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM Journal on Computing, 22(2):221-242, 1993.
14. O. Berkman and U. Vishkin. Finding level-ancestors in trees. Journal of Computer and System Sciences, 48(2):214-230, 1994.
15. th Annual ACM Symposium on Theory of Computing (STOC), pages 279-288, 1998.
16. S. Carlsson and B. J. Nilsson. Computing vision points in polygons. Algorithmica, 24(1):50-75, 1999.
17. 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.
18. th Annual ACM Symposium on Discrete Algorithms (SODA), pages 139-149, January 1995.
19. th Symposium on Massively Parallel Computation, pages 513-514. IEEE, New York, 1992.
20. th Annual ACM Symposium on Discrete Algorithms (SODA), pages 235-244, 1999.
21. L. J. Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38:170-183, 2001.
22. P. F. Dietz. Finding level-ancestors in dynamic trees. In Proceedings of the 2nd Workshop on Algorithms and Data Structures, volume 1097 of LNCS, pages 32-40. Springer-Verlag, Berlin, 1991.
23. 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.
24. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11-20, August 1998.
25. D. Eppstein. Finding common ancestors and disjoint paths in DAGs. Technical Report ICS-TR-95-52, Department of Information and Computer Science, University of California, Irvine, 1995.
26. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, 1998. Including [24].
27. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 137-143, 1997.
28. M. Farach-Colton, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1/2):155-179, 1995.
29. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of LNCS, pages 757-772. Springer-Verlag, Berlin, 2001.
30. th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of LNCS, pages 65-75. Springer-Verlag, Berlin March 2002.
31. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 428-437, October 1986.
32. G. N. Frederickson and R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164-181, February 1990.
33. 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.
34. st Annual ACM Symposium on Theory of Computing (STOC), pages 345-354, 1989.
35. st Annual ACM Symposium on Discrete Algorithms (SODA), pages 434-443, 1990.
36. th Annual ACM Symposium on Theory of Computing (STOC), pages 135-143, 1984.
37. E. N. Gilbert and E. F. Moore. Variable-length binary encodings. Bell System Technical Journal, 38:933-967, 1959.
38. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, 1997.
39. st Annual IEEE Symposium on Foundations of Computer Science(FOCS), pages 308-319, 1980.
40. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal Computing, 13(2):338-355, 1984.
41. 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 Proc. STOC 1988.
42. 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 Proc. STOC 1988.
43. th International Workshop on Algorithms and Data Structures (WADS), volume 2125 of LNCS, pages 32-40. Springer-Verlag, Berlin, August 2001.
44. 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.
45. V. King. Private communication, July 1999.
46. J. Komlos. Linear verification for spanning trees. Combinatorica, pages 57-65, 1985.
47. R. Lin. Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses. Information Processing Letters, 40(4):223-230, 1991.
48. R. Lin and S. Olariu. A simple optimal parallel algorithm to solve the lowest common ancestor problem. In ICCI: Advances in Computing and Information-ICCI: International Conference on Computing and Information, volume 497 of LNCS. Springer-Verlag, Berlin, 1991.
49. P. Looges. Optimal solution to the least common ancestor problem on the linear array with reconfigurable global buses. Technical Report TR-92-32, Old Dominion University, 1992.
50. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 132-141, 1977.
51. K. Mehlhorn. A best possible bound for the weighted path length of binary search trees. SIAM Journal on Computing, 6(2):235-239, June 1977.
52. M. Nykänen and E. Ukkonen. Finding lowest common ancestors in arbitrarily directed trees. Information Processing Letters, 50(6):307-310, 1994.
53. th Annual ACM Symposium on Discrete Algorithms (SODA), pages 487-493, 2000.
54. th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1665 of LNCS, pages 30-41. Springer-Verlag, Berlin, 1999.
55. th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1893 of LNCS, pages 579-588. Springer-Verlag, Berlin, August 2000.
56. P. Powell. A further improved LCA algorithm. Technical Report TR90-01, University of Minneapolis, 1990.
57. th International Colloquium on Automata, Languages and Programming (ICALP), volume 443 of LNCS. Springer-Verlag, Berlin, 1990.
58. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The Computer Journal, 28:5-8, 1985.
59. th Scandinavian Workshop on Algorithm Theory (SWAT '94) (Århus, 1994).
60. th International Parallel Processing Symposium (IPPS), pages 507-513, Newport Beach, CA, IEEE Computer Society Press, Piscataway, NJ, April 1993.
61. th Symposium on Massively Parallel Computation, pages 571-572, 1992.
62. B. Schieber. Parallel lowest common ancestor computation. In J. H. Reif, editor. Synthesis of Parallel Algorithms, pages 259-273. Morgan Kaufmann San Mateo, CA, 1993.
63. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal of Computing, 17:1253-1262, 1988.
64. 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 Proc STOC 1981.
65. 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 Proc STOC 1981.
66. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, June 1972.
67. R. E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690-715, 1979.
68. 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.
69. th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-10, 2001.
70. Y. H. Tsin. Finding lowest common ancestors in parallel. IEEE Transactions on Computers, 35(8):764-769, 1986.
71. J. Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, 1980.
72. Z. Wen. New algorithms for the LCA problem and the binary tree reconstruction problem. Information Processing Letters, 51(1):11-16, July 1994.
73. th International Colloquium on Automata, Languages and Programming (ICALP), volume 623 of LNCS, pages 342-353. Springer-Verlag, Berlin, 1992.