Steiner tree problem


Question: Given a set S of k-vertices, is it possible to construct a graph G of p vertices(p>k) containing S such that G contains a Steiner tree T of S. Is the above problem is equivalent to the Steiner tree problem?

Solution Preview :

Prepared by a verified Expert
Mathematics: Steiner tree problem
Reference No:- TGS0703602

Now Priced at $20 (50% Discount)

Recommended (90%)

Rated (4.3/5)