Figure 8
From: Sampling solution traces for the problem of sorting permutations by signed reversals
Maximum amount of main memory used by the partial enumeration algorithms. Sets of 100 random permutations with 40 ≤ n ≤ 200 and d(π) = ⌈(n + 1)/2⌉ were generated and processed with the algorithms RA, DFALT, SWA4, SWA5, and SWA6 during a time limit of 60 seconds. The plot shows the average maximum amount of main memory used by the algorithms while processing each set of 100 permutations.