Fig. 5
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
a The distribution of wall-clock running time for constructing alignment graphs, solving the ILP formulations for GTED and its lower bound, and their linear relaxations on the log scale. b The relationship between the time to solve (lower bound ILP), (exponential ILP) iteratively and GTED. c The distribution of the number of iterations to solve exponential ILP. The box plots in each plot show the median (middle line), the first and third quantiles (upper and lower boundaries of the box), the range of data within 1.5 inter-quantile range between Q1 and Q3 (whiskers), and the outlier data points