Abstract
Let S be a set of at least two vertices in a graph G. A subtree T of G is a S-Steiner tree if S subset of V(T). Two S-Steiner trees T-1 and T-2 are ed......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
