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