Fig. 2

Running time comparison of the algorithms for the construction of a common refinement of k input trees on leaf set L. The subplots of each row show boxplots for the running time for different numbers of leaves |L| (indicated on the x-axis) and different values of \(k\in \{2, 8, 32\}\) (indicated in the leftmost column of each subplot). In each row, a different probability \(p\in \{0.1, 0.5, 0.9\}\) for edge contraction was used to produce the k input trees. Per combination of the parameters |L|, k, and p, 100 instances were simulated to which all four algorithm were applied