The Steiner tree problem
Problem definition: Given a weighted undirected graph G(V,E), and a set S subset of V find the Minimum-Cost tree that spans the nodes in S. This problem is known in the literature as the Steiner tree problem. Let M the number of nodes in S, which we will call participants.
What is the name of set of input vertices in Steiner tree problem?
Some call it as terminal set, participant set, Steiner set....etc.
So What is the real name of input vertices?