
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
BiingFeng Wang, ShanChyun Ku, KengHua ShiI, "CostOptimal Parallel Algorithms for the Tree Bisector and Related Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 9, pp. 888898, September, 2001.  
BibTex  x  
@article{ 10.1109/71.954619, author = {BiingFeng Wang and ShanChyun Ku and KengHua ShiI}, title = {CostOptimal Parallel Algorithms for the Tree Bisector and Related Problems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {9}, issn = {10459219}, year = {2001}, pages = {888898}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.954619}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  CostOptimal Parallel Algorithms for the Tree Bisector and Related Problems IS  9 SN  10459219 SP888 EP898 EPD  888898 A1  BiingFeng Wang, A1  ShanChyun Ku, A1  KengHua ShiI, PY  2001 KW  Parallel algorithms KW  trees KW  bisectors KW  location theory KW  EREW PRAM KW  tree contraction KW  the Eulertour technique. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—An edge is a bisector of a simple path if it contains the middle point of the path. Let
[1] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka, "A Simple Parallel Tree Contraction Algorithm," J. Algorithms, vol. 10, no. 2, pp. 287302, 1989.
[2] E.A. Albacea, “Parallel Algorithm for Finding a Core of a Tree Network,” Information Processing Letters, vol. 51, pp. 223226, 1994.
[3] M. Ajtai,J. Komlos,W.L. Steiger, and E. Szemeredi,"An O(n log n) sorting network," Proc. Ann. ACM Symp. Theory of Computing, pp. 19, 1983.
[4] R.I. Becker and Y. Perl, “Finding the TwoCore of a Tree,” Discrete Applied Math., vol. 11, no. 2, pp.103113, 1985.
[5] O. Berkman, B. Schieber, and U. Vishkin, "Optimal Doubly Logarithmic Parallel Algorithms Based on Finding Nearest Smaller Values," J. Algorithms, vol. 14, no. 3, pp. 344370, 1993.
[6] O. Berkman and U. Vishkin, “Finding LevelAncestors in Trees,” J. Computer and Science Sciences, vol. 48, pp.231254, 1994.
[7] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[8] R. Cole and U. Vishkin, "Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Computing, vol. 18, pp. 128142, 1988.
[9] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[10] K. Diks and W. Rytter, “On Optimal Parallel Computations for Sequences of Brackets,” Theoretical Computer Science, vol. 87, pp. 251262, 1991.
[11] B. Gavish and S. Sridhar, “Computing the 2Median on Tree Networks in$O(n\lg n)$Time,” Networks, vol. 26, no. 4, pp. 305317, 1995.
[12] A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge Univ. Press, 1988.
[13] S.L. Hakimi, E.F. Schmeichel, and M. Labbe, “On Locating Path or TreeShaped Facilities on Networks,” Networks, vol. 23, pp. 543555, 1993.
[14] G.Y. Handler and P. Mirchandani, Location on Networks. Cambridge, Mass.: MIT Press, 1979.
[15] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[16] O. Kariv and S.L. Hakimi, “An Algorithmic Approach to Network Location Problems. II: The pMedians,” SIAM J. Applied Math., vol. 37, no. 3, 1979.
[17] G.L. Miller and J. Reif, “Parallel Tree Contraction and Its Applications,” Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pp. 478489, 1985.
[18] S. Peng and W.T. Lo, “A Simple Optimal Algorithm for a Core of a Tree,” J. Parallel and Distributed Computing, vol. 20, pp. 388392, 1994.
[19] S. Peng and W.T. Lo, “The Optimal Location of a Structured Facility in a Tree Network,” Parallel Algorithms and Applications, vol. 2, pp. 4360, 1994.
[20] S. Peng and W.T. Lo, “Efficient Algorithms for Finding a Core of a Tree with a Specified Length,” J. Algorithms, vol. 20, pp. 445458, 1996.
[21] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[22] P.V. Rangan, H.M. Vin, and S. Ramanathan, “Designing an OnDemand Multimedia Service,” Comm. Magazine, vol. 30, no. 7, Jul. 1992.
[23] A. Tamir, “An$O(pn^2)$Algorithm for thepmedian and Related Problems on Tree Graphs,” Operations Research Letters, vol. 19, no. 2, pp. 5964, 1996.
[24] B.C. Tansel, R.L. Francis, and T.J. Lowe, “Location on Networks: A Survey,” Management Science, vol. 29, pp. 482511, 1983.
[25] R.E. Tarjan and U. Vishkin, “Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time,” SIAM J. Computing, vol. 14, no. 4, pp. 81874, 1985.
[26] B.F. Wang, “Finding akTree Core and akTree Center of a Tree Network in Parallel,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 186191, Feb. 1998.
[27] B.F. Wang, “Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network,” J. Algorithms, vol. 34, pp. 90108, 2000.
[28] B.F. Wang, S.C. Ku, K.H. Shi, T.K. Hung, and P.S. Liu, “Parallel Algorithms for the Tree Bisector Problem and Applications,” Proc. 1999 Int'l Conf. Parallel Processing, pp. 192199, 1999.