Parallel decomposition of distance-hereditary graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1557, Issue , 1999, Pages 417-426

  Hsieh, Sun yuan ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BINS; GRAPH THEORY; IMAGE PROCESSING; VIDEO SIGNAL PROCESSING;

DECOMPOSITION TREES; DISTANCE-HEREDITARY GRAPHS; TREE CONTRACTION; TREE REPRESENTATION;

TREES (MATHEMATICS);

EID: 84957697236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49164-3_40     Document Type: Conference Paper

References (17)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm. Journal of Algorithms., 10, pp. 287-302, 1989.
2. H. J. Bandelt and H. M. Mulder. Distance-hereditary graphs. Journal of Combinatorial Theory Series B, 41(1): 182-208, Augest 1989.
3. A. Brandstadt and F. F. Dragan, A linear time algorithm for connected 7-domination and Steiner tree on distance-hereditary graphs, Networks, 31: 177-182, 1998.
4. M. S. Chang, S. Y. Hsieh, and G. H. Chen. Dynamic Programming on Distance-Hereditary Graphs. Proceedings of 7th International Symposium on Algorithms and Computation, ISAAC97, to appear.
5. R. Cole, "Parallel merge sort," SIAM Journal on Computing, 17(4): 770-785, 1988.
6. D. G. Corneil, H. Lerchs, and L. S. Burlingham, Complement reducible graphs. Discrete Applied Mathematics., 3, pp. 163-174, 1981.
7. E. Dahlhaus, "Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes," Lecture notes in computer science 726, pp. 60-69.
8. E. Dahlhaus. Efficient parallel recognition algorithms of cographs and distance-hereditary graphs. Discrete applied, mathematics, 57(1): 29-44, February 1995.
9. A. Datri and M. Moscarini. Distance-hereditary graphs, steiner trees, and connected domination. SIAM Journal on Computing, 17(3): 521-538, June, 1988.
10. F. F. Dragan, Dominating cliques in distance-hereditary graphs, Algorithm Theory-SWAT'94 4th Scandinavian Workshop on Algorithm Theory, LNCS 824, Springer, Berlin, pp. 370-381, 1994.
11. M. C. Golumbic. Algorithmic graph theory and perfect graphs, Academic press, New York, 1980.
12. P. L. Hammer and F. Maffray. Complete separable graphs. Discrete applied, mathematics, 27(1): 85-99, May 1990.
13. E. Howorka. A characterization of distance-hereditary graphs. Quarterly Journal of Mathematics (Oxford), 28(2): 417-420. 1977.
14. 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, to appear. A preliminary version of this paper is in Proceedings of the International Conference on Parallel Processing, pp. 20-23, 1997.
15. S.-y. Hsieh, C. W. Ho, T.-s. Hsu, M. T. Ko, and G. H. Chen. A new simple tree contraction scheme and its application on distance-hereditary graphs. Proceedings of Irregular'98, Springer-Verlag, to appear.
16. S.-y. Hsieh, C. W. Ho, T.-s. Hsu, M. T. Ko, and G. H. Chen. Characterization of efficiently solvable problems on distance-hereditary graphs. Proceedings of ISAAC'98, Springer-Verlag, to appear.
17. J. Jaja. An Introduction to Parallel Algorithms. Addison Wesley, 1992.