Abstract
The Nearest Common Ancestor (NCA) Problem can be broadly defined as follows: Given a rooted tree T and two nodes x, y ∈ T, find the common ancestor of x and y in T that is furthest from the root. In the static version of the problem, T is known in advance. In the dynamic version T is modified via some pre-defined operations. In the offline version, T as well all the NCA queries are known in advance. NCA problem has been studied extensively [16, 21, 15, 3, 25, 1, 6, 5, 8, 4].
Chapter PDF
Similar content being viewed by others
References
S. Alstrup and M. Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Journal of Algorithms, 35: 169 – 188, 2000.
A.M. Ben-Amram. What is a Pointer Machine? In SIGACT News, 26(2), 1995.
M.A. Bender and M. Farach-Colton. The LCA Problem Revisited. In Proceedings of LATIN 2000, Springer Verlag, 2000.
Berkman and U. Vishkin. Recursive *-Tree Parallel Data Structure. FOCS, 1989.
A.L. Buchsbaum et al. Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. In STOC, ACM Press, 1998.
R. Cole and R. Hariharan. Dynamic LCA Queries on Trees. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 235–244. ACM/SIAM, 1999.
. S.A. Cook and P.W. Dymond. Parallel Pointer Machines. Computational Com-
plexity, 3:19–30, 1993.
A. Dal Pahl, E. Pontelli, D. Ranjan. An Optimal Algorithm for Finding NCA on Pure Pointer Machines. Tech. Rep., TR-CS-007/2001, NMSU, 2001.
A. Dal Pahl, E. Pontelli, D. Ranjan. An Efficient Parallel Pointer Machine Algorithm for Nearest-Common Ancestor Problem. Tech. Rep., TR-CS-009/2001, NMSU, 2001.
P.W. Dymond, F.E. Fich, N. Nishimura, P. Ragde, W.L. Ruzzo. Pointers versus Arithmetic in PRAMs. In Structures in Complexity Theory Conf, IEEE, 1993.
S. Fortune and J. Wyllie. Parallelism in RAMs. In STOC, ACM Press, 1978.
H.N. Gabow and R. E. Tarjan A linear-time algorithm for a special case of disjoint set union J. Comput. System Sci 30 (1985), 209 – 221.
L.M. Goldschlager. A Universal Interconnection Pattern for Parallel Computers. In Journal of the ACM, 29, 1982.
M.T. Goodrich and S.R. Kosaraju. Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. In FOCS, IEEE, 1989.
D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1999.
D. Harel and R.E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13 (2): 338 – 355, 1984.
J.W. Hong. On Similarity and Duality of Computation. In FOCS, 1980.
D.E. Knuth. The Art of Computer Programming. Addison-Wesley, 1968.
E. Pontelli and D. Ranjan. Ancestor Problems on Pure Pointer Machines. In LATIN,Springer Verlag, 2002 (to appear).
D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta. The Temporal Precedence Problem. Algorithmica, 28: 288 – 306, 2000.
B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors. SIAM J. Comp, 17: 1253 – 1262, 1988.
A. Schönhage. Storage Modification Machines. SIAM Journal of Computing, 9 (3): 490 – 508, August 1980.
R.E. Tarjan. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. Journal of Computer and System Sciences, 2 (18): 110 - 127, 1979.
A. Tsakalidis. Maintaining Order in a Generalized Linked List. ACTA Informatica, (21): 101 – 112, 1984.
A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree. A C TA Informatica, 25: 37 – 54, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dal Palú, A., Pontelli, E., Ranjan, D. (2002). An Efficient Parallel Pointer Machine Algorithm for the NCA Problem. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive