Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)
Weighted connected domination and Steiner trees in distance-hereditary graphs
Unable to display preview. Download preview PDF.
- A. Brandstädt and F. F. Dragan, A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs, preprint, 1994.Google Scholar
- H. J. Bandelt and H. M. Mulder, Distance-hereditary graphs, J. Comb. Theory Series B, pp. 182–208, 1986.Google Scholar
- M. Burlet and J. P. Uhry, Parity graphs, Annals of Discrete Math. 21, pp. 253–277, 1984.Google Scholar
© Springer-Verlag Berlin Heidelberg 1996