 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. We say that a Steiner subgraph is minimal if it has no proper Steiner subgraph. It is easy to observe that every minimal Steiner subgraph forms a tree, which is called a minimal Steiner tree. We propose a linear delay and polynomial space ] ]  algorithm for enumerating all minimal Steiner trees of (G, W), which improves a previously known polynomial delay enumeration algorithm in [Kimelfeld and Sagiv, Inf.
<meaning-changed>  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. We say that a Steiner subgraph is minimal if it has no proper Steiner subgraph. It is easy to observe that every minimal Steiner subgraph forms a tree, which is called a minimal Steiner tree. We propose a linear delay and polynomial space ] ]  algorithm for enumerating all minimal Steiner trees of (G, W), which improves a previously known polynomial delay enumeration algorithm in [Kimelfeld and Sagiv, Inf.
 ASteiner subgraph Kimelfeld and Sagiv ] ] algorithm for enumerating all minimal Steiner trees of (G, W), which improves a previously known polynomial delay enumeration algorithm in [Kimelfeld and Sagiv, Inf.