Fig. 6
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
a An example of a 3-cycle graph. Cycle 1 and 2 are attached to cycle 3. b The distribution of wall-clock time to solve the compact ILP and the iterative exponential ILP on 100 pairs of 3-cycle graphs