Skip to main content
SpringerLink
Log in

Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

In this paper, we propose two efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network, respectively. Both algorithms take O(log n) time using O(n) work on the EREW PRAM. Our algorithms improve the algorithms previously proposed by Wang (IEEE Trans. Par. Dist. Sys. 1998) and Peng et al. (J. Algorithms 1993).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cole, R.: An Optimally Efficient Selection Algorithm. Information Processing Letters 26, 295–299 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cole, R., Vishkin, U.: Approximate Parallel Scheduling, Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Computing 17, 128–142 (1983)

    Article  MathSciNet  Google Scholar 

  3. Handler, G.Y., Mirchandani, P.: Location on Network. MIT Press, Cambridge (1979)

    Google Scholar 

  4. Jaja, J.: An Introduction to Parallel Algorithms. Addison Wesley, Reading (1992)

    MATH  Google Scholar 

  5. Miller, G.L., Reif, J.: Parallel Tree Contraction and Its Applications. In: Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pp. 478–489 (1985)

    Google Scholar 

  6. Minieka, E., Patel, N.H.: On finding the core of a tree with a specified length. Journal of Algorithms 4, 345–352 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Peng, S., Wang, T.: The Optimal Location of a Structured Facility in a Tree Network. Parallel Algorithms and Applications 2, 43–60 (1994)

    MATH  Google Scholar 

  8. Peng, S., Stephens, A.B., Yesha, Y.: Algorithms for a Core and k-tree Core of a Tree. J. Algorithms 15, 143–159 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sevilgen, F.E., Aluru, S., Futamura, F.: Parallel algorithms for tree accumulations. J. Parallel Distrib. Comput. 65, 85–93 (2005)

    Article  MATH  Google Scholar 

  10. Slater, P.J.: Locating central paths in a network. Transportation Science 16, 1–18 (1982)

    Article  MathSciNet  Google Scholar 

  11. Tarjan, R.E., Vishkin, U.: Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time. SIAM J. Computing 14, 861–874 (1985)

    MathSciNet  Google Scholar 

  12. Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on Networks: a Survey. Management Science 29, 482–511 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Wang, B.F.: Finding a k-tree core and a k-tree center of a tree network in parallel. IEEE Transactions on Parallel and Distributed Systems 9, 186–191 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dalian Maritime University, Dalian, 116026, China

    Yan Wang, Deqiang Wang, Wei Liu & Baoyu Tian

Authors
  1. Yan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deqiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Baoyu Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Wang, D., Liu, W., Tian, B. (2005). Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_56

Download citation

  • DOI: https://doi.org/10.1007/11602613_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation