Linear algorithms on Steiner domination of trees
Combinatorics
2020-03-02 v2 Discrete Mathematics
Abstract
A set of vertices in a connected graph is called a Steiner dominating set if is both Steiner and dominating set. The Steiner domination number is the minimum cardinality of a Steiner dominating set of . A linear algorithm is proposed in this paper for finding a minimum Steiner dominating set for a tree .
Cite
@article{arxiv.1904.06785,
title = {Linear algorithms on Steiner domination of trees},
author = {Yueming Shen and Chengye Zhao and Chenglin Gao and Yunfang Tang},
journal= {arXiv preprint arXiv:1904.06785},
year = {2020}
}