Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1997: Algorithms and Data Structures pp 368–377Cite as

A centroid labelling technique and its application to path selection in trees

Extended Abstract

  • Session 10B: Invited Lecture
  • Conference paper
  • First Online:

  • 128 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Atallah, R. Cole and M. Goodrich. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Computing, 499–532, 1989

    Google Scholar 

  2. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17:770–785, 1988.

    Google Scholar 

  3. R. Cole. Personal Communication.

    Google Scholar 

  4. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3:329–346, 1988.

    Google Scholar 

  5. G. N. Frederickson and D. B. Johnson. Finding kth paths and p-centers by generating and searching good data structures. J. Algorithms, 4:61–80, 1983.

    Google Scholar 

  6. He and Yesha. Efficient parallel algorithms for r-dominating set and p-center problems on trees. Algorithmica, 5, 1990.

    Google Scholar 

  7. O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems i: The p-centers. SIAM J. Appl. Math., 37:539–560, 1979.

    Google Scholar 

  8. N. Megiddo, A. Tamir, E. Zemel, and R. Chandrasekaran. An O(n log2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM Journal on Computing, 1981.

    Google Scholar 

  9. H. Shen. Fast parallel algorithm for finding the kth longest path in a tree. Proc. International Conference on Advances in Parallel and Distributed Computing (APDC'97), Shanghai, 1997.

    Google Scholar 

  10. H. Shen and S. Ramnath. Optimal parallel selection in sorted matrices. Information Processing Letters, 59:117–122, 1996.

    Google Scholar 

  11. S. Ramnath and H. Shen. Optimal Parallel Algorithm for Selecting the kth Longest Path in A Tree. Technical Report, St Cloud State University, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, St Cloud State University, 56301, St Cloud, MN, USA

    Sarnath Ramnath

  2. School of Computing and Information Technology, Griffith University, 4111, Nathan, QLD, Australia

    Hong Shen

Authors
  1. Sarnath Ramnath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Andrew Rau-Chaplin Jörg-Rüdiger Sack Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramnath, S., Shen, H. (1997). A centroid labelling technique and its application to path selection in trees. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-63307-3_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63307-5

  • Online ISBN: 978-3-540-69422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation