 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.
<clarity>  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 ] ] algorithm for enumerating all minimal Steiner trees , improving on a previous result in [Kimelfeld and Sagiv, Inf.