Skip to main content
SpringerLink
Log in

A parallel algorithm for path-min queries in trees

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

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

Included in the following conference series:

  • 134 Accesses

Abstract

Given a rooted tree T on n vertices with each vertex v having a label cost(v), preprocess T so that, given a pair of vertices v, w, the minimum-cost vertex on the path between v and w (the path-min of v and w) can be found efficiently. We give a preprocessing algorithm running in O(log n) time using O(n) processors in the CREW PRAM. After preprocessing, a path-min query can be answered in O(log n) time using a single processor.

Research supported in part by NSF Grant CCR-8907960.

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, J. Algorithms, 10, 287–302 (1989).

    Google Scholar 

  2. R.J. Anderson and G.L. Miller, Deterministic parallel list ranking, Proc. 3rd AWOC. (Lecture Notes in Computer Sciences, vol. 319) 81–90 (1988).

    Google Scholar 

  3. R.P. Brent, The parallel evaluation of general arithmetic expressions, J. ACM, 21, 201–206 (1974).

    Google Scholar 

  4. O. Berkman, D. Breslauer, Z. Galil, B. Schieber and U. Vishkin, Highly parallelizable problems, Proc. ACM Symp. on Theory of Computing, 309–319 (1989)

    Google Scholar 

  5. B. Chazelle, Computing on a free tree via complexity-preserving mappings, Algorithmica, 2, 337–361 (1987).

    Google Scholar 

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

    Google Scholar 

  7. D. Knuth, The art of programming: Fundamental algorithms, Addison-Wesley, Reading, Mass. (1968).

    Google Scholar 

  8. A.A. Schäffer, Optimal node ranking of trees in linear time, Inform. Process. Lett., 33, 91–96 (1989).

    Google Scholar 

  9. B. Schieber and U Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput., 17, 1253–1262 (1988).

    Google Scholar 

  10. R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput., 14, 862–874 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, FR-35, University of Washington, 98195, Seattle, WA

    Sung Kwon Kim

Authors
  1. Sung Kwon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S.K. (1991). A parallel algorithm for path-min queries in trees. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation