Fig. 3

Running time comparison of the algorithms for the construction of a common refinement of k input trees on leaf set L. Per combination of the parameters |L| (indicated on the horizontal axis), k (columns), and p (rows), 100 instances were simulated and median values are shown for all algorithms. 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