 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>  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.
 We propose a linear delay and polynomial space Kimelfeld and Sagiv, PODS 2006] ] algorithm for enumerating all minimal Steiner trees of (G, W), which improves a previously known polynomial delay enumeration algorithm in [Kimelfeld and Sagiv, Inf.