Abstract
Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size of a connected subgraph of G containing all the verti......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
