Skip to main content
SpringerLink
Log in

A simple optimal parallel algorithm to solve the lowest common ancestor problem

  • Parallel Processing And Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Included in the following conference series:

Abstract

The problem of computing the lowest common ancestors of all pairs of nodes in a rooted tree is central in a large number of practical applications. The purpose of this note is to propose a very simple cost-optimal parallel algorithm to solve the lowest common ancestor problem. More precisely, with an n-node rooted tree as input, our algorithm runs in O(log n) time using O(n2/log n) processors in the EREW-PRAM model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, Journal of Algorithms, 10 (1989) 287–302.

    Article  Google Scholar 

  2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, On finding Lowest Common Ancestors in Trees, SIAM Journal on Computing, 5, (1976) 115–132.

    Google Scholar 

  3. R. Cole and U. Vishkin, Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM Journal on Computing, 17, (1988) 128–142.

    Article  Google Scholar 

  4. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, 13, (1984) 338–355.

    Article  Google Scholar 

  5. J. JaJa and J. Simon, Parallel Algorithms in Graphs Theory: Planarity Testing, SIAM Journal on Computing, 11, (1982) 314–328.

    Google Scholar 

  6. D. Maier, An efficient method for storing ancestor information in trees, SIAM Journal on Computing, 8, (1979) 559–618.

    Google Scholar 

  7. C. D. Savage and J. JaJa, Fast, efficient parallel algorithms for some graph problems, SIAM Journal on Computing, 10, (1981) 682–691.

    Article  Google Scholar 

  8. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallellization, SIAM Journal on Computing, 17 (1988) 1253–1262.

    Google Scholar 

  9. R. E. Tarjan, and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM Journal on Computing, 14 (1985) 862–874.

    MathSciNet  Google Scholar 

  10. Y. H. Tsin, Finding lowest common ancestors in parallel, IEEE Trans. on Computers, 35 (1986), 764–769.

    Google Scholar 

  11. Y. H. Tsin and F. Y. Chin, Efficient Parallel Algorithms for a class of Graph Theoretic Problems, SIAM Journal on Computing, 13, (1984) 580–599.

    Google Scholar 

  12. U. Vishkin, Synchronous parallel computation — a survey, TR. 71, Department of Computer Science, Courant Institute, NYU, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Geneseo, 14454, Geneseo, NY

    R. Lin

  2. Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA

    S. Olariu

Authors
  1. R. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Olariu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, R., Olariu, S. (1991). A simple optimal parallel algorithm to solve the lowest common ancestor problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_194

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_194

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation