Let G = (V, E) be a undirected graph and let W \subseteq V be a set of terminals. ASteiner subgraph of (G, W) is a subgraph of G that contains all vertices of W and there is a path between every pair of vertices of W in the subgraph.
<clarity> Let G = (V, E) be a undirected graph and let W \subseteq V be a set of terminals. ASteiner subgraph of (G, W) is a subgraph of G that contains all vertices of W and there is a path between every pair of vertices of W in the subgraph.
Steiner subgraph of (G, W) is a subgraph of G that contains all vertices of W and there is a path between every pair of vertices of W in the subgraph.