r-domination problems on homogeneously orderable graphs

Networks

Volumn 30, Issue 2, 1997, Pages 121-131

  Dragan, Feodor F ^a   Nicolai, Falk ^b  

^a MOLDOVA STATE UNIVERSITY   (Moldova)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040600623     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199709)30:2<121::AID-NET6>3.0.CO;2-E     Document Type: Article

References (27)

1. H.-J. Bandelt and H. M. Mulder, Distance-hereditary graphs. J. Combin. Theory (B) 41 (1986) 182-208.
2. C. Berge, Hypergraphs. North-Holland (1989).
3. A. Brandstädt, Special graph classes - A survey. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-199 (1991).
4. A. Brandstädt and F. F. Dragan, A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-261 (1994).
5. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-244, (1994); extended abstract in Proceedings of WG'94, Lecture Notes in Computer Science 903, Springer (1995) 65-80.
6. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-244, (1994); extended abstract in Proceedings of WG'94, Lecture Notes in Computer Science 903, Springer (1995) 65-80.
7. A. Brandstädt, F. F. Dragan, V. D. Chepoi, and V. I. Voloshin, Dually chordal graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-225, (1993); extended abstract in Proceedings of WG '93, Lecture Notes in Computer Science 790, Springer, (1993) 237-251.
8. A. Brandstädt, F. F. Dragan, V. D. Chepoi, and V. I. Voloshin, Dually chordal graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-225, (1993); extended abstract in Proceedings of WG '93, Lecture Notes in Computer Science 790, Springer, (1993) 237-251.
9. A. Brandstädt, F. F. Dragan, and F. Nicolai, Homogeneously orderable graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-271 (1994) (to appear in Theor. Comput. Sci.); extended abstract in Proceedings of WG'95, Lecture Notes in Computer Science 1017, Springer (1995) 381-395.
10. A. Brandstädt, F. F. Dragan, and F. Nicolai, Homogeneously orderable graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-271 (1994) (to appear in Theor. Comput. Sci.); extended abstract in Proceedings of WG'95, Lecture Notes in Computer Science 1017, Springer (1995) 381-395.
11. A. Brandstädt and D. Kratsch, Domination problems on permutation and other graphs. Theor. Comput. Sci. 54 (1987) 181-198.
12. A. D'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees and connected domination. SIAM J. Comput. 17 (1988) 521-538.
13. F. F. Dragan, HT-graphs: Centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova 1(2) (1993) 64-83
14. F. F. Dragan, Dominating cliques in distance-hereditary graphs. Proceedings of "Algorithm Theory - SWAT94," 4th Scandinavian Workshop on Algorithm Theory, Aarhus. Denmark, Lecture Notes in Computer Science 824, Springer (1994) 370-381.
15. F. F. Dragan, Dominating cliques in distance-hereditary graphs. Proceedings of "Algorithm Theory - SWAT94," 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, Lecture Notes in Computer Science 824, Springer (1994) 370-381.
16. F. F. Dragan and A. Brandstädt, r-Dominating cliques in graphs with hypertree structure. Proceedings of the 11th STACS, Caen, France, Lecture Notes in Computer Science 775, Springer (1994) 735-746; Discr. Math. 162 (1996) 93-108.
17. F. F. Dragan and A. Brandstadt, r-Dominating cliques in graphs with hypertree structure. Proceedings of the 11th STACS, Caen, France, Lecture Notes in Computer Science 775, Springer (1994) 735-746; Discr. Math. 162 (1996) 93-108.
18. F. F. Dragan and F. Nicolai, r-Domination problems on homogeneously orderable graphs. Proceedings of Workshop on "Fundamentals of Computation Theory" FCT'95, Lecture Notes in Computer Science 965, Springer (1995) 201-210.
19. F. F. Dragan, C. F. Prisacaru, and V. D. Chepoi, r-Domination and p-center problems on graphs (in Russian). Discr. Math. Moscow 4 (1992) 67-73.
20. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
21. P. L. Hammer and F. Maffray, Completely separable graphs. Discr. Appl. Math. 27 (1990) 85-99.
22. R. B. Hayward, C. Hoang, and F. Maffray, Optimizing weakly triangulated graphs. Graphs Combin. 5 (1989) 339-349.
23. S. C. Hedetniemi and R. Laskar, Eds., Topics on domination. Ann. Discr. Math. 48 (1991).
24. D. Kratsch, Finding dominating cliques efficiently in strongly chordal graphs and undirected path graphs. Ann. Discr. Math. 48 (1991) 225-238.
25. D. Kratsch, P. Damaschke, and A. Lubiw, Dominating cliques in chordal graphs. Discr. Math. 128 (1994) 269-275.
26. F. Nicolai, A hypertree characterization of distance-hereditary graphs. Technical Report, Gerhard-Mercator-Universität-Gesamthochschule Duisburg SM-DU-255 (1994).
27. R. Sritharan and J. S. Spinrad, Algorithms foi weakly triangulated graphs. Discr. Appl. Math. 19 (1995) 181-191.