In a deterministic algorithm with O(|V | + |E|) delay between two output cuts has been described. Recently, an algorithm listing all inclusion minimal s, t-cuts in Õ(|V |) amortized time (i.e., with an average running time linear up to logarithmic terms in |V | per cut) has been reported . Surprisingly, computing the size of largest inclusion-minimal cut is NP complete . Since crossover at cut-sets of size 1 is rather trivial, we first extract the 2edge connected components. These non-trivial scaffolds are then processed independently. For chemical graphs the simple algorithm outlined in Fig. is used. For each initial vertex x ∈ V (G) it starts from V ′ = {x} and V ′′ = V \ V ′ and proceeds by moving a vertex y ∈ V ′′ that is adjacent to some vertex in