
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
BiingFeng Wang, "Finding rDominating Sets and pCenters of Trees in Parallel," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 8, pp. 687398, August, 2004.  
BibTex  x  
@article{ 10.1109/TPDS.2004.36, author = {BiingFeng Wang}, title = {Finding rDominating Sets and pCenters of Trees in Parallel}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {15}, number = {8}, issn = {10459219}, year = {2004}, pages = {687398}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2004.36}, 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  Finding rDominating Sets and pCenters of Trees in Parallel IS  8 SN  10459219 SP687 EP398 EPD  687398 A1  BiingFeng Wang, PY  2004 KW  Trees KW  r{\hbox{}}{\rm{dominating}} sets KW  p{\hbox{}}{\rm{centers}} KW  network location theory KW  parallel algorithms KW  PRAM. VL  15 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Let
[1] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka, A Simple Parallel Tree Contraction Algorithm J. Algorithms, vol. 10, pp. 287302, 1989.
[2] M. Atallah, R. Cole, and M. Goodrich, Cascading DivideandConquer: A Technique for Designing Parallel Algorithms SIAM J. Computing, vol. 18, no. 3, pp. 499532, 1998.
[3] B. Berger, J. Rompel, and P.W. Shor, Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry J. Computer and System Sciences, vol. 49, no. 3, pp. 454477, 1994.
[4] B. Bozkaya and B. Tansel, A Spanning Tree Approach to the AbsolutepCenter Problem Location Science, vol. 6, pp. 83107, 1998.
[5] R. Chandrasekaran and A. Tamir, Polynomially Bounded Algorithms for LocatingpCenters on a Tree Math. Programming, vol. 22, pp. 304315, 1982.
[6] R. Cole, Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms J. ACM, vol. 34, pp. 200208, 1987.
[7] R. Cole, An Optimally Efficient Selection Algorithm Information Processing Letters, vol. 26, pp. 295299, 1988.
[8] 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. Computing, vol. 17, no. 1, pp. 128141, 1988.
[9] R. Cole and U. Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time Algorithmica, vol. 3, pp. 329346, 1988.
[10] G.N. Frederickson, Parametric Search and Locating Supply Centers in Trees Proc. Second Workshop Algorithms and Data Structures, pp. 299319, 1991.
[11] G.N. Frederickson and D.B. Johnson, Findingkth Paths andpCenters by Generating and Searching Good Data Structures J. Algorithms, vol. 4, pp. 6180, 1983.
[12] A.J. Goldman, Optimal Center Location in Simple Networks Transportation Science, vol. 5, pp. 212221, 1971.
[13] A.J. Goldman, Minmax Location of a Facility in an Undirected Tree Graph Transportation Science, vol. 6, pp. 407418, 1972.
[14] S.L. Hakimi, E.F. Schmeichel, and M. Labbe, On Locating Path or TreeShaped Facilities on Networks Networks, vol. 23, pp. 543555, 1993.
[15] G.Y. Handler, Minimax Location of a Facility in an Undirected Tree Graph Transportation Science, vol. 7, pp. 287293, 1973.
[16] G.Y. Handler, Finding TwoCenters of a Tree: The Continuous Case Transportation Science, vol. 12, pp. 93106, 1978.
[17] X. He and Y. Yesha, Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs J. Algorithms, vol. 9, pp. 92113, 1988.
[18] X. He and Y. Yesha, Efficient Parallel Algorithms forrDominating Set andpCenter Problems on Trees Algorithmica, vol. 5, pp. 129145, 1990.
[19] J. JáJá, An Introduction to Parallel Algorithms. AddisonWesley, 1992.
[20] O. Kariv and S.L. Hakimi, An Algorithmic Approach to Network Location Problems SIAM J. Applied Math., vol. 37, pp. 513538, 1979.
[21] Y.B. Lin and I. Chlamtac, Wireless and Mobile Network Architecture. Wiley, 2001.
[22] J.Y.B. Lee, On a Unified Architecture for VideoonDemand Services IEEE Trans. Multimedia, vol. 4, no. 1, pp. 3847, 2002.
[23] M. Luby and N. Nisan, A Parallel Approximation Algorithm for Positive Linear Programming Proc. 25th ACM Symp. Theory of Computing, pp. 448457, 1993.
[24] N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms J. ACM, vol. 30, pp. 852865, 1983.
[25] N. Megiddo, A. Tamir, E. Zemel, and R. Chandrasekaran, An$O(n\log^2n)$Time Algorithm for thekth Longest Path in a Tree with Applications to Location Problems SIAM J. Computing, vol. 10, pp. 328337, 1981.
[26] N. Megiddo and A. Tamir, New Results on the Complexity ofpCenter Problems SIAM J. Computing, vol. 12, no. 4, pp. 751759, 1983.
[27] E. Minieka, The Optimal Location of a Path or Tree in a Tree Network Networks, vol. 15, pp. 309321, 1985.
[28] C.A. Morgan and P.L. Slater, A Linear Time Algorithm for a Core of a Tree J. Algorithms, vol. 1, pp. 247258, 1980.
[29] S. Peng and W.T. Lo, A Simple Optimal Parallel Algorithm for a Core of a Tree J. Parallel and Distributed Computing, vol. 20, pp. 388392, 1994.
[30] S. Peng and W. Lo, Efficient Algorithms for Finding a Core of a Tree with Specified Length J. Algorithms, vol. 15, pp. 143159, 1996.
[31] S. Rajagopalan and V. Vazirani, PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs SIAM J. Computing, vol. 28, no. 2, pp. 525540, 1999.
[32] 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. 862874, 1985.
[33] A. Tamir, An$O(pn^2)$Time Algorithm for thepMedian and Related Problems on Tree Graphs Operations Research Letters, vol. 19, no. 2, pp. 5964, 1996.
[34] A. Tamir, ThekCentrum MultiFacility Location Problem Discrete Applied Math., vol. 109, pp. 293307, 2001.
[35] 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.
[36] B.F. Wang, Finding a TwoCore of a Tree in Linear Time SIAM J. Discrete Math., vol. 15, no. 2, pp. 193210, 2002.
[37] B.F. Wang, S.C. Ku, and K.H. Shi, CostOptimal Parallel Algorithms for the Tree Bisector and Related Problems IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 9, pp. 888898, Sept. 2001.