A simple and fast parallel coloring algorithm for distance-hereditary graphs

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 12, 2003, Pages 1201-1208

  Hsieh, Sun Yuan ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Distance hereditary graphs; PRAM; The vertex coloring problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAM PROCESSORS; RANDOM ACCESS STORAGE;

DISTANCE HEREDITARY GRAPHS; PARALLEL RANDOM ACCESS MACHINE; VERTEX COLORING PROBLEM;

PARALLEL ALGORITHMS;

EID: 0742303618     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1255633     Document Type: Article

References (23)

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 γ-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 Graphs," 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.