Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs

Hong-Gwa Yeh, Gerard J. Chang. Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs. In Michel Deza, Reinhardt Euler, Yannis Manoussakis, editors, Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Volume 1120 of Lecture Notes in Computer Science, pages 48-52, Springer, 1995.

@inproceedings{YehC95,
  title = {Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs},
  author = {Hong-Gwa Yeh and Gerard J. Chang},
  year = {1995},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/YehC95},
  cites = {0},
  citedby = {0},
  pages = {48-52},
  booktitle = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers},
  editor = {Michel Deza and Reinhardt Euler and Yannis Manoussakis},
  volume = {1120},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61576-8},
}