
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
SunYuan Hsieh, "A Simple and Fast Parallel Coloring Algorithm for DistanceHereditary Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 12, pp. 12011208, December, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1255633, author = {SunYuan Hsieh}, title = {A Simple and Fast Parallel Coloring Algorithm for DistanceHereditary Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {12}, issn = {10459219}, year = {2003}, pages = {12011208}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1255633}, 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  A Simple and Fast Parallel Coloring Algorithm for DistanceHereditary Graphs IS  12 SN  10459219 SP1201 EP1208 EPD  12011208 A1  SunYuan Hsieh, PY  2003 KW  Algorithms KW  distancehereditary graphs KW  the vertexcoloring problem KW  PRAM. VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In the literature, there are quite a few sequential and parallel algorithms to solve problems on distancehereditary graphs. Two wellknown classes of graphs, which contain trees and cographs, belong to distancehereditary graphs. In this paper, we consider the vertexcoloring problem on distancehereditary graphs. Let
[1] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, T. Przytycka, A Simple Parallel Tree Contraction Algorithm J. Algorithms, vol. 10, 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] A. Brandstädt and F.F. Dragan, A Linear Time Algorithm for Connected$\gamma$Domination and Steiner Tree on DistanceHereditary Graphs Networks, vol. 31, pp. 177182, 1998.
[4] M.S. Chang, S.Y. Hsieh, and G.H. Chen, Dynamic Programming on DistanceHereditary Graphs Proc. Seventh Int'l Symp. Algorithms and Computation, pp. 344353, 1997.
[5] A. D'atri and M. Moscarini, DistanceHereditary Graphs, Steiner Trees, and Connected Domination SIAM J. Computing, vol. 17, no. 3, pp. 521538, 1988.
[6] F.F. Dragan, Dominating Cliques in DistanceHereditary Graphs Proc. Algorithm TheorySWAT '94 Fourth Scandinavian Workshop Algorithm Theory, pp. 370381, 1994.
[7] P.L. Hammer and F. Maffray, Complete Separable Graphs Discrete Applied Math., vol. 27, no. 1, pp. 8599, 1990.
[8] E. Howorka, A Characterization of DistanceHereditary Graphs Quarterly J. Math., vol. 28, no. 2, pp. 417420, 1977.
[9] 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 (ACPC '99), pp. 417426, 1999.
[10] S.Y. Hsieh, An Efficient Parallel Algorithm for the Efficient Domination Problem on DistanceHereditary Graphs IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 985993, Sept. 2002.
[11] 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.
[12] 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.
[13] S.Y. Hsieh, C.W. Ho, T.S. Hsu, M.T. Ko, and G.H. Chen, Characterization of Efficiently Parallel Solvable Problems on DistanceHereditary Graphs SIAM J. Discrete Math., vol. 15, no. 4, pp. 488518, 2002.
[14] J. JáJá, An Introduction to Parallel Algorithms. Addison Wesley, 1992.
[15] R.M. Karp and V. Ramachandran, Parallel Algorithms for Shared Memory Machines Handbook of Theoretical Computer Science, pp. 869941, Amsterdam: NorthHolland, 1990.
[16] R. Lin and S. Olariu, Fast Parallel Algorithms for Cographs Proc. Foundations of Software Technology and Theoretical Computer Science, pp. 176189, 1990.
[17] G.L. Miller and S.H. Teng, TreeBased Parallel Algorithm Design Algorithmica, vol. 19, pp. 369389, 1997.
[18] H. Müller and F. Nicolai, Polynomial Time Algorithms for Hamiltonian Problems on Bipartite DistanceHereditary Graphs Information Processing Letters, vol. 46, pp. 225230, 1993.
[19] F. Nicolai, Hamiltonian Problems on DistanceHereditary Ggraphs technique report, GerhardMercator Univ., Germany, 1994.
[20] D.B. West, Introduction to Graph Theory. N.J.: PrenticeHall, 1996.
[21] H.G. Yeh and G.J. Chang, Weighted Connected Domination and Steiner Trees in DistanceHereditary Graphs Discrete Applied Math., vol. 87, no. 13, pp. 245253, 1998.
[22] H.G. Yeh and G.J. Chang, The PathPartition Problem in Bipartite DistanceHereditary Graphs Taiwaness J. Math., vol. 2, no. 3, pp. 353360, 1998.
[23] H.G. Yeh and G.J. Chang, Weighted Connected$k$Domination and Weighted$k$Dominating Clique in DistanceHereditary Graphs Theoretical Computer Science, vol. 263, pp. 38, 2001.