Advertisement

Weighted connected domination and Steiner trees in distance-hereditary graphs

Extended abstract
  • Hong-Gwa Yeh
  • Gerard J. Chang
Graph Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23, pp. 11–24, 1989.CrossRefGoogle Scholar
  2. [2]
    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
  3. [3]
    H. J. Bandelt and H. M. Mulder, Distance-hereditary graphs, J. Comb. Theory Series B, pp. 182–208, 1986.Google Scholar
  4. [4]
    M. Burlet and J. P. Uhry, Parity graphs, Annals of Discrete Math. 21, pp. 253–277, 1984.Google Scholar
  5. [5]
    C. J. Colbourn and L. K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Math. 86, pp. 145–164, 1990.CrossRefGoogle Scholar
  6. [6]
    D. G. Corneil, H. Lerchs, and L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3, pp. 163–174, 1981.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Hong-Gwa Yeh
    • 1
  • Gerard J. Chang
    • 1
  1. 1.Department of Applied MathematicsNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations