A Linear-Time Algorithm for Connected r-Domination and Steiner Tree on Distance-Hereditary Graphs

Networks

Volumn 31, Issue 3, 1998, Pages 177-182

  Brandstädt, Andreas ^a   Dragan, Feodor F ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Connected domination; Distance hereditary graph; Linear time algorithm; Steiner tree

Indexed keywords

EID: 0347873743     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C     Document Type: Article

References (14)

1. H.-J. Bandelt and H. M. Mulder, Distance-hereditary graphs. J. Comb. Theory Ser. B 41 (1986) 182-208.
2. A. Brandstädt, Special graph classes - a survey. Technical Report SM-DU-199, University Duisburg (1993).
3. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. 20th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG'94), Herrsching, Germany, 1994, LNCS 903 (E. W. Mayr, G. Schmidt, and G. Tinhofer, Eds.). Springer, Berlin (1995) 65-80. To appear in Discr. Appl. Math.
4. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. 20th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG'94), Herrsching, Germany, 1994, LNCS 903 (E. W. Mayr, G. Schmidt, and G. Tinhofer, Eds.). Springer, Berlin (1995) 65-80. To appear in Discr. Appl. Math.
5. G. J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs. Discr. Appl. Math. 22 (1988/89) 21-34.
6. A. D'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees and connected domination. SIAM J. Comput. 17 (1988) 521-538.
7. F. F. Dragan, HT-graphs: centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova 1(2) (1993) 64-83.
8. F. F. Dragan, Dominating cliques in distance-hereditary graphs. Algorithm Theory - SWAT'94 "4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 1994, LNCS 824 (E. M. Schmidt and Sven Skyum, Eds.). Springer, Berlin (1994) 370-381.
9. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
10. P. L. Hammer and F. Maffray, Completely separable graphs. Discr. Appl. Math. 27 (1990) 85-99.
11. S. C. Hedetniemi and R. Laskar, Eds., Topics on Domination. Ann. Discr. Math. 48 (1991), 280 p.
12. E. Howorka, A characterization of distance-hereditary graphs. Q. J. Math. Oxford, Ser. 2 28 (1977) 417-420.
13. F. Nicolai, A hypertree characterization of distance-hereditary graphs. Technical Report SM-DU-255, University of Duisburg (1994).
14. F. Nicolai, Strukturelle und algorithmische Aspekte distanz-erblicher Graphen und verwandter Klassen. Dissertation, Gerhard-Mercator-Universität-GH-Duisburg (1994).