Characterization of efficiently parallel solvable problems on distance-hereditary graphs

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 4, 2002, Pages 488-518

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

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Data structures; Distance hereditary graphs; Parallel random access machine; Subgraph optimization problems

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

DISTANCE-HEREDITARY GRAPHS;

TREES (MATHEMATICS);

EID: 0036662508     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101389880     Document Type: Article

References (29)

1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, And T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms, 10 (1989), pp. 287-302.
2. H.J. Bandelt And H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 182-208.
3. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
4. H.L. Bodlaender And T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, SIAM J. Comput., 27 (1998), pp. 1725-1746.
5. A. Brandstädt And F.F. Dragan, A linear time algorithm for connected γ-domination and Steiner tree on distance-hereditary graphs, Networks, 31 (1998), pp. 177-182.
6. M.S. Chang, S.Y. Hsieh, And G.H. Chen, Dynamic programming on distance-hereditary graphs, in Proceedings of the 7th International Symposium on Algorithms and Computation (ISAAC'97), Lecture Notes in Comput. Sci. 1350, Springer-Verlag, Berlin, 1997, pp. 344-353.
7. R. Cole, Parallel merge sort, SIAM J. Comput., 17 (1988), pp. 770-785.
8. D.G. Corneil, H. Lerchs, And L.S. Burlingham, Complement reducible graphs, Discrete Appl. Math., 3 (1981), pp. 163-174.
9. B. Courcelle, J.A. Makowsky, And U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125-150.
10. E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance-hereditary graphs, Discrete Appl. Math., 57 (1995), pp. 29-44.
11. A. D'atri And M. Moscarini, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput., 17 (1988), pp. 521-538.
12. F.F. Dragan, Dominating cliques in distance-hereditary graphs, in Algorithm Theory-SWAT'94: 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 824, Springer-Verlag, Berlin, 1994, pp. 370-381.
13. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
14. M.C. Golumbic And U. Rotics, On the clique-width of perfect graph classes, in Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Comput. Sci. 1665, Springer-Verlag, Berlin, 1999, pp. 135-147.
15. P.L. Hammer And F. Maffray, Complete separable graphs, Discrete Appl. Math., 27 (1990), pp. 85-99.
16. X. He, Efficient parallel algorithms for solving some tree problems, in Proceedings of the 24th Allerton Conference on Communication, Control, and Computing, 1986, pp. 777-786.
17. X. He, Parallel algorithm for cograph recognition with applications, J. Algorithms, 15 (1993), pp. 284-313.
18. E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. (2), 28 (1977), pp. 417-420.
19. 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), pp. 43-52.
20. 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, 35 (2000), pp. 50-81.
21. J. Ja'ja', An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
22. R.M. Karp And V. Ramachandran, Parallel algorithms for shared memory machines, in Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, pp. 869-941.
23. R. Lin And S. Olariu, An optimal parallel matching algorithm for cographs, J. Parallel Distrib. Comput., 22 (1994), pp. 26-36.
24. G.L. Miller And S.H. Teng, Tree-based parallel algorithm design, Algorithmica, 19 (1997), pp. 369-389.
25. F. Nicolai, Hamiltonian Problems on Distance-Hereditary Graphs, Technique report, Gerhard-Mercator University, Duisburg, Germany, 1994.
26. Y. Shiloach And U. Viskin, An O(log n) parallel connectivity algorithm, J. Algorithms, 3 (1982), pp. 57-63.
27. H.G. Yeh And G.J. Chang, Weighted connected domination and Steiner trees in distance-hereditary graphs, Discrete Appl. Math., 87 (1998), pp. 245-253.
28. H.G. Yeh And G.J. Chang, Linear-Time Algorithms for Bipartite Distance-Hereditary Graphs, manuscript.
29. H.G. Yeh And G.J. Chang, The path-partition problem in bipartite distance-hereditary graphs, Taiwanese J. Math., 2 (1998), pp. 353-360.