A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs

Journal of Algorithms

Volumn 35, Issue 1, 2000, Pages 50-81

  Hsieh, Sun Yuan ^a,c   Ho, Chin Wen ^b   Hsu, Tsan Sheng ^c   Ko, Ming Tat ^c   Chen, Gen Huey ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002203068     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1064     Document Type: Article

References (35)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989), 287-302.
2. H. J. Bandelt and H. M. Mulder, Distance-hereditary graphs, J. Combin. Theory Ser. B 41 (1989), 182-208.
3. C. Berge, "Graphs and Hypergraphs," North-Holland, Amsterdam, 1973.
4. O. Berkman, B. Schieber, and U. Vishkin, Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values, J. Algorithms 14 (1993), 344-370.
5. O. Berkman, Y. Matias, and P. Ragde, Triply-logarithmic parallel upper and lower bounds for minimum and range minimum over small domains, J. Algorithms 28 (1998), 197-215.
6. A. Brandstadt, "Special Graph Classes - A Survey," Technical Report SM-DU-199, University of Duisburg, 1993.
7. A. Branstadt and F. F. Dragan, A linear time algorithm for connected γ-domination and Steiner tree on distance-hereditary graphs, Networks 31 (1998), 177-182.
8. G. J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988), 21-34.
9. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988), 770-785.
10. R. Cole and U. Vishkin, Approximate parallel scheduling, II: application to optimal parallel graph algorithms in logarithmic time, Inform. and Comput. 92 (1991), 1-47.
11. E. Dahlhaus, Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes, in "Proceedings of 18th International Workshop on Graph-Theoretic Concepts in Computer Science," Lecture Notes in Computer Science, Vol. 657, pp. 60-69, Springer-Verlag, Berlin, 1993.
12. E. Dahlhaus and P. Damaschke, The parallel solution of domination problems on chordal and strongly chordal graphs, Discrete Appl. Math. 52 (1994), 261-273.
13. E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance-hereditary graphs, Discrete Appl. Math. 57 (1995), 29-44.
14. A. Dátri and M. Moscarini, Distance-hereditary graphs, steiner trees, and connected domination, SIAM J. Comput. 17 (1988), 521-538.
15. F. F. Dragan, HT-graphs: centers, connected γ-domination and Steiner trees, Comput. Sci. J. Moldova 1 (1993), 64-83.
16. F. F. Dragan, Dominating cliques in distance-hereditary graphs, in "Proceedings of the 4th Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 824, pp. 370-381, Springer-Verlag, Berlin, 1994.
17. F. F. Dragan and A. Brandstadt, γ-dominating cliques in Helly graphs and chordal graphs, in "Proceedings of 11th Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 775, pp. 735-746, Springer-Verlag, Berlin, 1994.
18. H. Gazit, G. L. Miller, and S. H. Tseng, Optimal tree contraction in the EREW model, in "Princeton Workshop Book," Plenum, New York, 1989.
19. A. Gibbons and W. Rytter, Optimal parallel algorithms for dynamic expression evaluation and context-free recognition, Inform. and Comput. 81 (1989), 32-45.
20. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
21. P. L. Hammer and F. Maffray, Complete Separable Graphs, Discrete Appl. Math. 27 (1990), 85-99.
22. X. He, Efficient parallel algorithms for solving some tree problems, in "Proc. 24th Allerton Conference on Communication, Control, and Computing," pp. 777-786, 1986.
23. X. He and Y. Yesha, Binary tree algebraic computation and parallel algorithms for simple graphs, J. Algorithms 9 (1988), 92-113.
24. S. C. Hedetniemi and R. Laskar (Eds.), Topics on domination, in "Annals of Discrete Mathematics," p. 48, North-Holland, Amsterdam, 1991.
25. E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. (Oxford), 28 (1977), 417-420.
26. S.-y. Hsieh, C. W. Ho, T.-s. Hsu, M. T. Ko, and G. H. Chen, Efficient parallel algorithms on distance-hereditary graphs, Parallel Process. Lett. 9 (1999), 43-52. [A preliminary version of this paper is in "Proceedings of the International Conference on Parallel Processing," pp. 20-23, 1997.]
27. S.-y. Hsieh, C. W. Ho, T.-s. Hsu, M. T. Ko, and G. H. Chen, Efficient parallel algorithms on distance-hereditary graphs, Parallel Process. Lett. 9 (1999), 43-52. [A preliminary version of this paper is in "Proceedings of the International Conference on Parallel Processing," pp. 20-23, 1997.]
28. J. JáJá, "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA, 1992.
29. R. M. Karp and V. Ramachandran, Parallel algorithms for shared memory machines, in "Handbook of Theoretical Computer Science," pp. 869-941, North-Holland, Amsterdam, 1990.
30. P. Klein, Efficient parallel algorithms for chordal graphs, SIAM J. Comput. 25 (1996), 797-827.
31. G. L. Miller and J. Reif, Parallel tree contraction and its applications, in "Proceedings of 17th Annual Symposium on the Theory of Computing," pp. 478-489, 1985.
32. G. L. Miller and J. Reif, Parallel tree contraction, Part 2: Further applications, SIAM J. Computing 20 (1991), 1128-1147.
33. J. Naor, M. Naor, and A. A. Schäffer, Fast parallel algorithms for chordal graphs, SIAM J. Comput. 18 (1989), 327-349.
34. V. Ramachandran, Fast parallel algorithms for reducible flow graphs, in "Concurrent Computations: Algorithms, Architecture and Technology" (S. K. Tewksbury, B. W. Dickson, and S. C. Schwartz, Eds.), Proc. of the 1987 Princeton Workshop on Algorithm, Architecture and Technology Issues for Models of Concurrent Computations, pp. 117-138, Plenum Press, New York, 1988.
35. V. Ramachandran, Parallel algorithms for reducible flow graphs, J. Algorithms 23 (1997), 1-31.