Author:
Balakrishnan Hari,Rajaraman Anand,Rangan C. Pandu
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. K. Arvind and C. Pandu Rangan. Connected domination and Steiner set on weighted permutation graphs. Info. Proc. Letts., 41:215–220, 1992.
2. C.J. Colburn and L.K. Stewart. Permutation graphs: Connected domination and Steiner trees. Discrete Math., 86:145–164, 1990.
3. D.G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs. Technical Report 262/92, University of Toronto, June 1992.
4. D.G. Corneil and L.K. Stewart. Dominating sets in perfect graphs. Discrete Math., 86:179–189, 1990.
5. A. D'Atri and M. Mascarini. Distance hereditary graphs, Steiner trees and connected domination. SIAM J. Computing, 17:521–538, 1988.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献