This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Simple and Fast Parallel Coloring Algorithm for Distance-Hereditary Graphs
December 2003 (vol. 14 no. 12)
pp. 1201-1208

Abstract—In the literature, there are quite a few sequential and parallel algorithms to solve problems on distance-hereditary graphs. Two well-known classes of graphs, which contain trees and cographs, belong to distance-hereditary graphs. In this paper, we consider the vertex-coloring problem on distance-hereditary graphs. Let T_{d}(|V|,|E|) and P_{d}(|V|,|E|) denote the time and processor complexities, respectively, required to construct a decomposition tree representation of a distance-hereditary graph G=(V,E) on a PRAM model M_{d}. Our algorithm runs in O(T_{d}(|V|,|E|)+\log |V|) time using O(P_{d}(|V|,|E|)+|V|/\log |V|) processors on M_{d}. The best known result for constructing a decomposition tree needs O(\log^{2}|V|) time using O(|V|+|E|) processors on a CREW PRAM. If a decomposition tree is provided as input, we solve the problem in O(\log |V|) time using O(|V|/\log |V|) processors on an EREW PRAM. To the best of our knowledge, there is no parallel algorithm for this problem on distance-hereditary graphs.

[1] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, T. Przytycka, A Simple Parallel Tree Contraction Algorithm J. Algorithms, vol. 10, pp. 287-302, 1989.
[2] H.J. Bandelt and H.M. Mulder, Distance-Hereditary Graphs J. Combinatorial Theory, Series B, vol. 41, no. 1, pp. 182-208, 1989.
[3] A. Brandstädt and F.F. Dragan, A Linear Time Algorithm for Connected$\gamma$-Domination and Steiner Tree on Distance-Hereditary Graphs Networks, vol. 31, pp. 177-182, 1998.
[4] M.S. Chang, S.Y. Hsieh, and G.H. Chen, Dynamic Programming on Distance-Hereditary Graphs Proc. Seventh Int'l Symp. Algorithms and Computation, pp. 344-353, 1997.
[5] A. D'atri and M. Moscarini, Distance-Hereditary Graphs, Steiner Trees, and Connected Domination SIAM J. Computing, vol. 17, no. 3, pp. 521-538, 1988.
[6] F.F. Dragan, Dominating Cliques in Distance-Hereditary Graphs Proc. Algorithm Theory-SWAT '94 Fourth Scandinavian Workshop Algorithm Theory, pp. 370-381, 1994.
[7] P.L. Hammer and F. Maffray, Complete Separable Graphs Discrete Applied Math., vol. 27, no. 1, pp. 85-99, 1990.
[8] E. Howorka, A Characterization of Distance-Hereditary Graphs Quarterly J. Math., vol. 28, no. 2, pp. 417-420, 1977.
[9] S.Y. Hsieh, Parallel Decomposition of Distance-Hereditary 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. 417-426, 1999.
[10] S.Y. Hsieh, An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 985-993, Sept. 2002.
[11] S.Y. Hsieh, C.W. Ho, T.-S. Hsu, M.T. Ko, and G.H. Chen, Efficient Parallel Algorithms on Distance-Hereditary Graphs Parallel Processing Letters, vol. 9, no. 1, pp. 43-52, 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 Distance-Hereditary Graphs J. Algorithms, vol. 35, pp. 50-81, 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 Distance-Hereditary Graphs SIAM J. Discrete Math., vol. 15, no. 4, pp. 488-518, 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. 869-941, Amsterdam: North-Holland, 1990.
[16] R. Lin and S. Olariu, Fast Parallel Algorithms for Cographs Proc. Foundations of Software Technology and Theoretical Computer Science, pp. 176-189, 1990.
[17] G.L. Miller and S.H. Teng, Tree-Based Parallel Algorithm Design Algorithmica, vol. 19, pp. 369-389, 1997.
[18] H. Müller and F. Nicolai, Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs Information Processing Letters, vol. 46, pp. 225-230, 1993.
[19] F. Nicolai, Hamiltonian Problems on Distance-Hereditary Ggraphs technique report, Gerhard-Mercator Univ., Germany, 1994.
[20] D.B. West, Introduction to Graph Theory. N.J.: Prentice-Hall, 1996.
[21] H.G. Yeh and G.J. Chang, Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs Discrete Applied Math., vol. 87, no. 1-3, pp. 245-253, 1998.
[22] H.G. Yeh and G.J. Chang, The Path-Partition Problem in Bipartite Distance-Hereditary Graphs Taiwaness J. Math., vol. 2, no. 3, pp. 353-360, 1998.
[23] H.G. Yeh and G.J. Chang, Weighted Connected$k$-Domination and Weighted$k$-Dominating Clique in Distance-Hereditary Graphs Theoretical Computer Science, vol. 263, pp. 3-8, 2001.

Index Terms:
Algorithms, distance-hereditary graphs, the vertex-coloring problem, PRAM.
Citation:
Sun-Yuan Hsieh, "A Simple and Fast Parallel Coloring Algorithm for Distance-Hereditary Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 12, pp. 1201-1208, Dec. 2003, doi:10.1109/TPDS.2003.1255633
Usage of this product signifies your acceptance of the Terms of Use.