Comments on "Enumeration of all minimal cutsets for a node pair in a graph

The commenters point out that the algorithm of S.A. Kumar and S.H. Lee for the enumeration of all minimal s-t cutsets is defective (see ibid., vol.R-26, p.51-5, April 1979). It is illustrated through an example that their algorithm misses several minimal cutsets. The commenters cite two reasons for this: the adjacency problem and the back-vertex problem.<
>