
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sunyuan Hsieh, "An Efficient Parallel Algorithm for the Efficient Domination Problem on DistanceHereditary Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 985993, September, 2002.  
BibTex  x  
@article{ 10.1109/TPDS.2002.1036071, author = {Sunyuan Hsieh}, title = {An Efficient Parallel Algorithm for the Efficient Domination Problem on DistanceHereditary Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {13}, number = {9}, issn = {10459219}, year = {2002}, pages = {985993}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2002.1036071}, 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  An Efficient Parallel Algorithm for the Efficient Domination Problem on DistanceHereditary Graphs IS  9 SN  10459219 SP985 EP993 EPD  985993 A1  Sunyuan Hsieh, PY  2002 KW  Parallel algorithm KW  PRAM KW  distancehereditary graphs KW  the efficient domination problem KW  binary tree contraction technique. VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In the literature, there are quite a few sequential and parallel algorithms for solving problems on distancehereditary graphs. With an
[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] H.J. Bandelt and H.M. Mulder, “DistanceHereditary Graphs,” J. Combinatorial Theory Series B, vol. 41, no. 1, pp. 182208, 1989.
[3] H.J. Bandelt, A. Henkmann, and F. Nicolai, “Powers of DistanceHereditary Graphs,” Discrete Math., vol. 145, pp. 3760, 1995.
[4] D. Bange, A. Barkauskas, and P. J. Slater, “Disjoint Dominating Sets in Trees,” Sandia Laboratories Report, SAND 781087J, 1978.
[5] D. Bange, A. Barkauskas, and P.J. Slater, “Efficient Dominating Sets in Graphs,” Application of Discrete Math., R.D. Ringeisen and F.S. Roberts, eds., pp. 189199, 1988.
[6] N. Biggs, “Perfect Codes in Graphs,” J. Combinatorial Theory Series B, vol. 15, pp. 289296, 1973.
[7] A. Brandstädt and F.F. Dragan, “A Linear Time Algorithm for Connected$\big. \gamma\hbox{}{\rm{Domination}}\bigr.$and Steiner Tree on DistanceHereditary Graphs,” Networks, vol. 31, pp. 177182, 1998.
[8] M.S. Chang and Y.C. Liu, “Polynomial Algorithm for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs,” Information Processing Letters, vol. 48, pp. 205210, 1993.
[9] G.J. Chang, C.P. Rangan, and S.R. Coorg, “Weighted Independent Perfect Domination on Cocomparability Graphs,” Discrete Applied Math., vol. 63, pp. 215222, 1995.
[10] M.S. Chang, S.Y. Hsieh, and G.H. Chen, “Dynamic Programming on DistanceHereditary Graphs,” Proc. Seventh Int'l Symp. Algorithms and Computation (ISAAC'97), pp. 344353, 1997.
[11] Y.D. Liang, C.L. Lu, and C.Y. Tang, “Efficient Domination on Permutation Graphs and Trapezoid Graphs,” Proc. Third Ann. Int'l Computing and Combinatorics Conf., (COCOON '97), pp. 232241, 1997.
[12] A. D'atri and M. Moscarini, “DistanceHereditary Graphs, Steiner Trees, and Connected Domination,” SIAM J. Computing, vol. 17, no. 3, pp. 521538, 1988.
[13] F.F. Dragan, “Dominating Cliques in DistanceHereditary Graphs,” Proc. Fourth Scandinavian Workshop Algorithm Theory (SWAT '94), pp. 370381, 1994.
[14] A. Esfahanian and O.R. Oellermann, “DistanceHereditary Graphs and Multidestination MessageRouting in Multicomputers,” J. Combinatorial Math. and Combinatorial Computing, vol. 13, pp. 213222, 1993.
[15] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs.New York, Academic Press, 1980.
[16] P.L. Hammer and F. Maffray, “Complete Separable Graphs,” Discrete Applied Math., vol. 27, no. 1, pp. 8599, 1990.
[17] X. He, “Efficient Parallel Algorithms for Solving Some Tree Problems,” Proc. 24th Allerton Conf. Communication, Control, and Computing, pp. 777786, 1986.
[18] X. He, “Efficient Parallel Algorithms for SeriesParallel Graphs,” J. Algorithms, vol. 12, pp. 409430, 1991.
[19] X. He and Y. Yesha, “Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs,” J. Algorithms, vol. 9, pp. 92113, 1988.
[20] E. Howorka, “A Characterization of DistanceHereditary Graphs,” Quarterly J. Math. (Oxford), vol. 28, no. 2, pp. 417420, 1977.
[21] S.Y. Hsieh, C.W. Ho, T.S. Hsu, M.T. Ko, and G.H. Chen, “Efficient Parallel Algorithms on DistanceHereditary Graphs,” Parallel Processing Letters, vol. 9, no. 1, pp. 4352, 1999.
[22] S.Y. Hsieh, “Parallel Decomposition of DistanceHereditary Graphs,” Proc. Fourth Int'l ACPC Conf. including Special Tracks on Parallel Numerics (ParNum'99) and Parallel Computing in Image Processing, Video Processing, and Multimedia, pp. 417426, 1999.
[23] S.Y. Hsieh, C.W. Ho, T.S. Hsu, M.T. Ko, and G.H. Chen, “A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on DistanceHereditary Graphs,” J. Algorithms, vol. 35 pp. 5081, 2000.
[24] S.Y. Hsieh, C.W. Ho, T.S. Hsu, M.T. Ko, and G.H. Chen, “Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs,” Proc. 8th Int'l Symp. Algorithms and Computation (ISAAC '98), pp. 257266, 1998.
[25] R.M. Karp and V. Ramachandran, "Parallel Algorithms for SharedMemory Machines," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 869941.Amsterdam: NorthHolland, 1990.
[26] M. Livingston and Q.F. Stout, “Perfect Dominating Sets,” Congressus Numerantium, vol. 79, pp. 187203, 1990.
[27] C.L. Lu and C.Y. Tang, “Efficient Domination on Bipartite Graphs,” Manuscript, 1996.
[28] H. Müller and F. Nicolai, “Polynomial Time Algorithms for Hamiltonian Problems on Bipartite DistanceHereditary Graphs,” Information Processing Letters, vol. 46, no. 5, pp. 225230, 1993.
[29] F. Nicolai, “Hamiltonian Problems on DistanceHereditary Graphs,” Technique Report SMDU264, Univ. Duisburg, Germany, 1994.
[30] O.R. Oellermann, “Computing the Average Distance of a DistanceHereditary Graph in Linear Time,” Congressus Numerantium, vol. 103, pp. 219223, 1994.
[31] H.G. Yeh and G.J. Chang, “Weighted Connected Domination and Steiner Trees in DistanceHereditary Graphs,” Discrete Applied Math., vol. 87, pp. 245253, 1998.
[32] C.C. Yen, “Algorithmic Aspects of Perfect Domination,” PhD thesis, Department of Computer Science, National Tsing Hua Univ., Taiwan, 1992.
[33] C.C. Yen, R.C.T. Lee, “The Weighted Perfect Domination Problem and Its Variants,” Discrete Applied Math., vol. 66, pp. 147160, 1996.