1 paper
Qingnan Zhang, Yingzhi Tian
Given a connected graph G=(V,E) and a k-set S⊆V(G), the Steiner distance dG(S) of S is defined as the size of a minimum tree including S in G. The $St…