Selected papers that cite this one
- J. S. Provan and D. R. Shier. A paradigm for listing (s,t)-cuts in graphs. Algorithmica, 15(4):351-372, April 1996.
- Hong Shen and Weifa Liang. Efficient enumeration of all minimal separators in a graph. Theoretical Computer Science, 180(1-2):169-180, 10 June 1997.